Results for 'inconsistency natural numbers Peano axioms contradiction infinity Godel formal systems not finitist proof deduction'

996 found
Order:
  1.  6
    The Buridan-Volpin Derivation System; Properties and Justification.Sven Storms - 2022 - Bulletin of Symbolic Logic 28 (4):533-535.
    Logic is traditionally considered to be a purely syntactic discipline, at least in principle. However, prof. David Isles has shown that this ideal is not yet met in traditional logic. Semantic residue is present in the assumption that the domain of a variable should be fixed in advance of a derivation, and also in the notion that a numerical notation must refer to a number rather than be considered a mathematical object in and of itself. Based on his work, the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2. Natural Deduction: The Logical Basis of Axiom Systems[REVIEW]D. J. P. - 1963 - Review of Metaphysics 17 (1):141-142.
    Here is a deft and new introduction to Gentzen proof techniques in axiom systems and to the analysis of formal axiom systems; in short, axiomatics inside and out. Treating of deduction in propositional and predicate logic, metatheoretical problems about both set theory and its paradoxes, the book is flexibly structured for selective use as a text. Yet the discussion is unified and motivated by the concept of the axiomatic system--the history of its use and analysis, (...)
     
    Export citation  
     
    Bookmark  
  3. Incompleteness and inconsistency.Stewart Shapiro - 2002 - Mind 111 (444):817-832.
    Graham Priest's In Contradiction (Dordrecht: Martinus Nijhoff Publishers, 1987, chapter 3) contains an argument concerning the intuitive, or ‘naïve’ notion of (arithmetic) proof, or provability. He argues that the intuitively provable arithmetic sentences constitute a recursively enumerable set, which has a Gödel sentence which is itself intuitively provable. The incompleteness theorem does not apply, since the set of provable arithmetic sentences is not consistent. The purpose of this article is to sharpen Priest's argument, avoiding reference to informal notions, (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   33 citations  
  4.  25
    Solving Smullyan Puzzles with Formal Systems.José Félix Costa & Diogo Poças - 2018 - Axiomathes 28 (2):181-199.
    Solving numeric, logic and language puzzles and paradoxes is common within a wide community of high school and university students, fact witnessed by the increasing number of books published by mathematicians such as Martin Gardner, Douglas Hofstadter [in one of the best popular science books on paradoxes ], inspired by Gödel’s incompleteness theorems), Patrick Hughes and George Brecht and Raymond M. Smullyan, inter alia. Books by Smullyan are, however, much more involved, since they introduce learning trajectories and strategies across several (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  5.  67
    Kurt gödel’s first steps in logic: Formal proofs in arithmetic and set theory through a system of natural deduction.Jan von Plato - 2018 - Bulletin of Symbolic Logic 24 (3):319-335.
    What seem to be Kurt Gödel’s first notes on logic, an exercise notebook of 84 pages, contains formal proofs in higher-order arithmetic and set theory. The choice of these topics is clearly suggested by their inclusion in Hilbert and Ackermann’s logic book of 1928, the Grundzüge der theoretischen Logik. Such proofs are notoriously hard to construct within axiomatic logic. Gödel takes without further ado into use a linear system of natural deduction for the full language of higher-order (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  6.  20
    First-Order Reasoning and Primitive Recursive Natural Number Notations.David Isles - 2010 - Studia Logica 96 (1):49-64.
    If the collection of models for the axioms 21 of elementary number theory is enlarged to include not just the " natural numbers " or their non-standard infinitistic extensions but also what are here called "primitive recursive notations", questions arise about the reliability of first-order derivations from 21. In this enlarged set of "models" some derivations usually accepted as "reliable" may be problematic. This paper criticizes two of these derivations which claim, respectively, to establish the totality of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  7.  36
    Pure Proof Theory. Mathematicians are interested in structures. There is only one way to find the theorems of a structure. Start with an axiom system for the structure and deduce the theorems logically. These axiom systems are the objects of proof-theoretical research. Studying axiom systems there is a series of more. [REVIEW]Wolfram Pohlers - 1996 - Bulletin of Symbolic Logic 2 (2):159-188.
    Apologies. The purpose of the following talk is to give an overview of the present state of aims, methods and results in Pure Proof Theory. Shortage of time forces me to concentrate on my very personal views. This entails that I will emphasize the work which I know best, i.e., work that has been done in the triangle Stanford, Munich and Münster. I am of course well aware that there are as important results coming from outside this triangle and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  8.  12
    Normalization proof for Peano Arithmetic.Annika Siders - 2015 - Archive for Mathematical Logic 54 (7-8):921-940.
    A proof of normalization for a classical system of Peano Arithmetic formulated in natural deduction is given. The classical rule of the system is the rule for indirect proof restricted to atomic formulas. This rule does not, due to the restriction, interfere with the standard detour conversions. The convertible detours, numerical inductions and instances of indirect proof concluding falsity are reduced in a way that decreases a vector assigned to the derivation. By interpreting the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9.  49
    Foundations of nominal techniques: logic and semantics of variables in abstract syntax.Murdoch J. Gabbay - 2011 - Bulletin of Symbolic Logic 17 (2):161-229.
    We are used to the idea that computers operate on numbers, yet another kind of data is equally important: the syntax of formal languages, with variables, binding, and alpha-equivalence. The original application of nominal techniques, and the one with greatest prominence in this paper, is to reasoning on formal syntax with variables and binding. Variables can be modelled in many ways: for instance as numbers (since we usually take countably many of them); as links (since they (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  10. Axioms of symmetry: Throwing darts at the real number line.Chris Freiling - 1986 - Journal of Symbolic Logic 51 (1):190-200.
    We will give a simple philosophical "proof" of the negation of Cantor's continuum hypothesis (CH). (A formal proof for or against CH from the axioms of ZFC is impossible; see Cohen [1].) We will assume the axioms of ZFC together with intuitively clear axioms which are based on some intuition of Stuart Davidson and an old theorem of Sierpinski and are justified by the symmetry in a thought experiment throwing darts at the real number (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   27 citations  
  11.  96
    The definability of the set of natural numbers in the 1925 principia mathematica.Gregory Landini - 1996 - Journal of Philosophical Logic 25 (6):597 - 615.
    In his new introduction to the 1925 second edition of Principia Mathematica, Russell maintained that by adopting Wittgenstein's idea that a logically perfect language should be extensional mathematical induction could be rectified for finite cardinals without the axiom of reducibility. In an Appendix B, Russell set forth a proof. Godel caught a defect in the proof at *89.16, so that the matter of rectification remained open. Myhill later arrived at a negative result: Principia with extensionality principles and (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  12.  16
    A strictly finitary non-triviality proof for a paraconsistent system of set theory deductively equivalent to classical ZFC minus foundation.Arief Daynes - 2000 - Archive for Mathematical Logic 39 (8):581-598.
    The paraconsistent system CPQ-ZFC/F is defined. It is shown using strong non-finitary methods that the theorems of CPQ-ZFC/F are exactly the theorems of classical ZFC minus foundation. The proof presented in the paper uses the assumption that a strongly inaccessible cardinal exists. It is then shown using strictly finitary methods that CPQ-ZFC/F is non-trivial. CPQ-ZFC/F thus provides a formulation of set theory that has the same deductive power as the corresponding classical system but is more reliable in that non-triviality (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  13. Natural Numbers and Natural Cardinals as Abstract Objects: A Partial Reconstruction of Frege"s Grundgesetze in Object Theory.Edward N. Zalta - 1999 - Journal of Philosophical Logic 28 (6):619-660.
    In this paper, the author derives the Dedekind-Peano axioms for number theory from a consistent and general metaphysical theory of abstract objects. The derivation makes no appeal to primitive mathematical notions, implicit definitions, or a principle of infinity. The theorems proved constitute an important subset of the numbered propositions found in Frege's *Grundgesetze*. The proofs of the theorems reconstruct Frege's derivations, with the exception of the claim that every number has a successor, which is derived from a (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   25 citations  
  14.  17
    “The Strict Deduction System Is Impossible to Derive the Contradiction” And the Proof.Fang-Wen Yuan - 2008 - Proceedings of the Xxii World Congress of Philosophy 13:147-162.
    Based on the strict definitions of concepts, such as deduction, the deduction rule and the deduction system, the form axiom, the substantive axiom, this article clearly shows the essence of the deductive reasoning, namely “Related attribute and the related restriction relations, which are conveyed in what the main concept of the deduction refers to, must be contained in those conveyed in what the premise proposition refers to”。Then puts forward the theorem “contradiction can not be derived (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15. Minds, Machines and Gödel.J. R. Lucas - 1961 - Etica E Politica 5 (1):1.
    In this article, Lucas maintains the falseness of Mechanism - the attempt to explain minds as machines - by means of Incompleteness Theorem of Gödel. Gödel’s theorem shows that in any system consistent and adequate for simple arithmetic there are formulae which cannot be proved in the system but that human minds can recognize as true; Lucas points out in his turn that Gödel’s theorem applies to machines because a machine is the concrete instantiation of a formal system: therefore, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   162 citations  
  16.  76
    On the philosophical significance of consistency proofs.Michael D. Resnik - 1974 - Journal of Philosophical Logic 3 (1/2):133 - 147.
    We have seen that despite Feferman's results Gödel's second theorem vitiates the use of Hilbert-type epistemological programs and consistency proofs as a response to mathematical skepticism. Thus consistency proofs fail to have the philosophical significance often attributed to them.This does not mean that consistency proofs are of no interest to philosophers. We know that a ‘non-pathological’ consistency proof for a system S will use methods which are not available in S. When S is as strong a system as we (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  17.  31
    Variants of Gödel’s Ontological Proof in a Natural Deduction Calculus.B. Woltzenlogel Paleo & Annika Kanckos - 2017 - Studia Logica 105 (3):553-586.
    This paper presents detailed formalizations of ontological arguments in a simple modal natural deduction calculus. The first formal proof closely follows the hints in Scott’s manuscript about Gödel’s argument and fills in the gaps, thus verifying its correctness. The second formal proof improves the first one, by relying on the weaker modal logic KB instead of S5 and by avoiding the equality relation. The second proof is also technically shorter than the first one, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  18.  8
    Gödel's Incompleteness Theorems.Raymond Smullyan - 2017 - In Lou Goble (ed.), The Blackwell Guide to Philosophical Logic. Oxford, UK: Blackwell. pp. 72–89.
    At the turn of the century, there appeared two comprehensive mathematical systems, which were indeed so vast that it was taken for granted that all mathematics could be decided on the basis of them. However, in 1931, Kurt Gödel surprised the entire mathematical world with his epoch‐making paper which begins with the following startling words: The development of mathematics in the direction of greater precision has led to large areas of it being formalized, so that proofs can be carried (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  19. Learning the Natural Numbers as a Child.Stefan Buijsman - 2017 - Noûs 53 (1):3-22.
    How do we get out knowledge of the natural numbers? Various philosophical accounts exist, but there has been comparatively little attention to psychological data on how the learning process actually takes place. I work through the psychological literature on number acquisition with the aim of characterising the acquisition stages in formal terms. In doing so, I argue that we need a combination of current neologicist accounts and accounts such as that of Parsons. In particular, I argue that (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  20.  29
    Misunderstanding Gödel: New Arguments about Wittgenstein and New Remarks by Wittgenstein.Victor Rodych - 2003 - Dialectica 57 (3):279-313.
    The long‐standing issue of Wittgenstein's controversial remarks on Gödel's Theorem has recently heated up in a number of different and interesting directions [,, ]. In their, Juliet Floyd and Hilary Putnam purport to argue that Wittgenstein's‘notorious’ “Contains a philosophical claim of great interest,” namely, “if one assumed. that →P is provable in Russell's system one should… give up the “translation” of P by the English sentence ‘P is not provable’,” because if ωP is provable in PM, PM is ω ‐inconsistent, (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  21.  93
    Misunderstanding gödel: New arguments about Wittgenstein and new remarks by Wittgenstein.Victor Rodych - 2003 - Dialectica 57 (3):279–313.
    The long‐standing issue of Wittgenstein's controversial remarks on Gödel's Theorem has recently heated up in a number of different and interesting directions [, , ]. In their , Juliet Floyd and Hilary Putnam purport to argue that Wittgenstein's‘notorious’ “Contains a philosophical claim of great interest,” namely, “if one assumed. that →P is provable in Russell's system one should… give up the “translation” of P by the English sentence ‘P is not provable’,” because if ωP is provable in PM, PM is (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  22. Sub-Theory of Peano Arithmetic.Andrew Boucher - unknown
    The system called F is essentially a sub-theory of Frege Arithmetic without the ad infinitum assumption that there is always a next number. In a series of papers (Systems for a Foundation of Arithmetic, True” Arithmetic Can Prove Its Own Consistency and Proving Quadratic Reciprocity) it was shown that F proves a large number of basic arithmetic truths, such as the Euclidean Algorithm, Unique Prime Factorization (i.e. the Fundamental Law of Arithmetic), and Quadratic Reciprocity, indeed a sizable amount of (...)
     
    Export citation  
     
    Bookmark  
  23. The development of arithmetic in Frege's Grundgesetze der Arithmetik.Richard Heck - 1993 - Journal of Symbolic Logic 58 (2):579-601.
    Frege's development of the theory of arithmetic in his Grundgesetze der Arithmetik has long been ignored, since the formal theory of the Grundgesetze is inconsistent. His derivations of the axioms of arithmetic from what is known as Hume's Principle do not, however, depend upon that axiom of the system--Axiom V--which is responsible for the inconsistency. On the contrary, Frege's proofs constitute a derivation of axioms for arithmetic from Hume's Principle, in (axiomatic) second-order logic. Moreover, though Frege (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   59 citations  
  24.  39
    Pure proof theory aims, methods and results.Wolfram Pohlers - 1996 - Bulletin of Symbolic Logic 2 (2):159-188.
    Apologies. The purpose of the following talk is to give an overview of the present state of aims, methods and results in Pure Proof Theory. Shortage of time forces me to concentrate on my very personal views. This entails that I will emphasize the work which I know best, i.e., work that has been done in the triangle Stanford, Munich and Münster. I am of course well aware that there are as important results coming from outside this triangle and (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  25. Gödel mathematics versus Hilbert mathematics. I. The Gödel incompleteness (1931) statement: axiom or theorem?Vasil Penchev - 2022 - Logic and Philosophy of Mathematics eJournal (Elsevier: SSRN) 14 (9):1-56.
    The present first part about the eventual completeness of mathematics (called “Hilbert mathematics”) is concentrated on the Gödel incompleteness (1931) statement: if it is an axiom rather than a theorem inferable from the axioms of (Peano) arithmetic, (ZFC) set theory, and propositional logic, this would pioneer the pathway to Hilbert mathematics. One of the main arguments that it is an axiom consists in the direct contradiction of the axiom of induction in arithmetic and the axiom of (...) in set theory. Thus, the pair of arithmetic and set are to be similar to Euclidean and non-Euclidean geometries distinguishably only by the Fifth postulate now, i.e. after replacing it and its negation correspondingly by the axiom of finiteness (induction) versus that of finiteness being idempotent negations to each other. Indeed, the axiom of choice, as far as it is equivalent to the well-ordering “theorem”, transforms any set in a well-ordering either necessarily finite according to the axiom of induction or also optionally infinite according to the axiom of infinity. So, the Gödel incompleteness statement relies on the logical contradiction of the axiom of induction and the axiom of infinity in the final analysis. Nonetheless, both can be considered as two idempotent versions of the same axiom (analogically to the Fifth postulate) and then unified after logicism and its inherent intensionality since the opposition of finiteness and infinity can be only extensional (i.e., relevant to the elements of any set rather than to the set by itself or its characteristic property being a proposition). So, the pathway for interpreting the Gödel incompleteness statement as an axiom and the originating from that assumption for “Hilbert mathematics” accepting its negation is pioneered. A much wider context relevant to realizing the Gödel incompleteness statement as a metamathematical axiom is consistently built step by step. The horizon of Hilbert mathematics is the proper subject in the third part of the paper, and a reinterpretation of Gödel’s papers (1930; 1931) as an apology of logicism as the only consistent foundations of mathematics is the topic of the next second part. (shrink)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  26.  31
    Gödel’s Natural Deduction.Kosta Došen & Miloš Adžić - 2018 - Studia Logica 106 (2):397-415.
    This is a companion to a paper by the authors entitled “Gödel on deduction”, which examined the links between some philosophical views ascribed to Gödel and general proof theory. When writing that other paper, the authors were not acquainted with a system of natural deduction that Gödel presented with the help of Gentzen’s sequents, which amounts to Jaśkowski’s natural deduction system of 1934, and which may be found in Gödel’s unpublished notes for the elementary (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  27.  30
    Normality, Non-contamination and Logical Depth in Classical Natural Deduction.Marcello D’Agostino, Dov Gabbay & Sanjay Modgil - 2020 - Studia Logica 108 (2):291-357.
    In this paper we provide a detailed proof-theoretical analysis of a natural deduction system for classical propositional logic that (i) represents classical proofs in a more natural way than standard Gentzen-style natural deduction, (ii) admits of a simple normalization procedure such that normal proofs enjoy the Weak Subformula Property, (iii) provides the means to prove a Non-contamination Property of normal proofs that is not satisfied by normal proofs in the Gentzen tradition and is useful (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  28.  68
    Arithmetic based on the church numerals in illative combinatory logic.M. W. Bunder - 1988 - Studia Logica 47 (2):129 - 143.
    In the early thirties, Church developed predicate calculus within a system based on lambda calculus. Rosser and Kleene developed Arithmetic within this system, but using a Godelization technique showed the system to be inconsistent.Alternative systems to that of Church have been developed, but so far more complex definitions of the natural numbers have had to be used. The present paper based on a system of illative combinatory logic developed previously by the author, does allow the use of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  29. Gödel on intuition and on Hilbert's finitism.W. W. Tait - 2010 - In Kurt Gödel, Solomon Feferman, Charles Parsons & Stephen G. Simpson (eds.), Kurt Gödel: Essays for His Centennial. Association for Symbolic Logic.
    There are some puzzles about G¨ odel’s published and unpublished remarks concerning finitism that have led some commentators to believe that his conception of it was unstable, that he oscillated back and forth between different accounts of it. I want to discuss these puzzles and argue that, on the contrary, G¨ odel’s writings represent a smooth evolution, with just one rather small double-reversal, of his view of finitism. He used the term “finit” (in German) or “finitary” or “finitistic” primarily to (...)
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  30.  76
    Inconsistent models for relevant arithmetics.Robert Meyer & Chris Mortensen - 1984 - Journal of Symbolic Logic 49 (3):917-929.
    This paper develops in certain directions the work of Meyer in [3], [4], [5] and [6]. In those works, Peano’s axioms for arithmetic were formulated with a logical base of the relevant logic R, and it was proved finitistically that the resulting arithmetic, called R♯, was absolutely consistent. It was pointed out that such a result escapes incau- tious formulations of Goedel’s second incompleteness theorem, and provides a basis for a revived Hilbert programme. The absolute consistency result used (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   25 citations  
  31.  58
    Hilbert's program modi ed.Solomon Feferman - unknown
    The background to the development of proof theory since 1960 is contained in the article (MATHEMATICS, FOUNDATIONS OF), Vol. 5, pp. 208- 209. Brie y, Hilbert's program (H.P.), inaugurated in the 1920s, aimed to secure the foundations of mathematics by giving nitary consistency proofs of formal systems such as for number theory, analysis and set theory, in which informal mathematics can be represented directly. These systems are based on classical logic and implicitly or explicitly depend on (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  32. Consistency, Turing Computability and Gödel’s First Incompleteness Theorem.Robert F. Hadley - 2008 - Minds and Machines 18 (1):1-15.
    It is well understood and appreciated that Gödel’s Incompleteness Theorems apply to sufficiently strong, formal deductive systems. In particular, the theorems apply to systems which are adequate for conventional number theory. Less well known is that there exist algorithms which can be applied to such a system to generate a gödel-sentence for that system. Although the generation of a sentence is not equivalent to proving its truth, the present paper argues that the existence of these algorithms, when (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  33.  17
    Contradiction as a Positive Property of the Mind: 90 Years of Gödel’s Argument.Dmitriy V. Vinnik - 2022 - Russian Journal of Philosophical Sciences 64 (7):26-45.
    The article discusses the V.V. Tselishchev’s original and unique systematic study of the specific and extremely complicated problems of Gödel results regarding the question of artificial intelligence essence. Tselishchev argues that the reflexive property should be considered not only as an advantage of human reasoning, but also as an objective internal limitation that appears in case of adding Gödel sentence to a theory to build a new theory. The article analyzes so-called mentalistic Gödel’s argument for fundamental superiority of human intelligence (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  34.  44
    Natural Deduction Systems for Intuitionistic Logic with Identity.Szymon Chlebowski, Marta Gawek & Agata Tomczyk - 2022 - Studia Logica 110 (6):1381-1415.
    The aim of the paper is to present two natural deduction systems for Intuitionistic Sentential Calculus with Identity ( ISCI ); a syntactically motivated \(\mathsf {ND}^1_{\mathsf {ISCI}}\) and a semantically motivated \(\mathsf {ND}^2_{\mathsf {ISCI}}\). The formulation of \(\mathsf {ND}^1_{\mathsf {ISCI}}\) is based on the axiomatic formulation of ISCI. Its rules cannot be straightforwardly classified as introduction or elimination rules; ISCI -specific rules are based on axioms characterizing the identity connective. The system does not enjoy the standard (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  35.  76
    A Formalization of Set Theory Without Variables.István Németi - 1988 - American Mathematical Soc..
    Completed in 1983, this work culminates nearly half a century of the late Alfred Tarski's foundational studies in logic, mathematics, and the philosophy of science. Written in collaboration with Steven Givant, the book appeals to a very broad audience, and requires only a familiarity with first-order logic. It is of great interest to logicians and mathematicians interested in the foundations of mathematics, but also to philosophers interested in logic, semantics, algebraic logic, or the methodology of the deductive sciences, and to (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   46 citations  
  36. Meillassoux’s Virtual Future.Graham Harman - 2011 - Continent 1 (2):78-91.
    continent. 1.2 (2011): 78-91. This article consists of three parts. First, I will review the major themes of Quentin Meillassoux’s After Finitude . Since some of my readers will have read this book and others not, I will try to strike a balance between clear summary and fresh critique. Second, I discuss an unpublished book by Meillassoux unfamiliar to all readers of this article, except those scant few that may have gone digging in the microfilm archives of the École normale (...)
     
    Export citation  
     
    Bookmark   2 citations  
  37.  40
    On the restricted ordinal theorem.R. L. Goodstein - 1944 - Journal of Symbolic Logic 9 (2):33-41.
    The proposition that a decreasing sequence of ordinals necessarily terminates has been given a new, and perhaps unexpected, importance by the rôle which it plays in Gentzen's proof of the freedom from contradiction of the “reine Zahlentheorie.” Gödel's construction of non-demonstrable propositions and the establishment of the impossibility of a proof of freedom from contradiction, within the framework of a certain type of formal system, showed that a proof of freedom from contradiction could (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  38. Leibniz on the laws of nature and the best deductive system.Joshua L. Watson - 2012 - Studies in History and Philosophy of Science Part A 43 (4):577-584.
    Many philosophers who do not analyze laws of nature as the axioms and theorems of the best deductive systems nevertheless believe that membership in those systems is evidence for being a law. This raises the question, “If the best systems analysis fails, what explains the fact that being a member of the best systems is evidence for being a law?” In this essay I answer this question on behalf of Leibniz. I argue that although Leibniz’s (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  39.  92
    Axioms and tests for the presence of minimal consciousness in agents I: Preamble.Igor L. Aleksander & B. Dunmall - 2003 - Journal of Consciousness Studies 10 (4-5):7-18.
    This paper relates to a formal statement of the mechanisms that are thought minimally necessary to underpin consciousness. This is expressed in the form of axioms. We deem this to be useful if there is ever to be clarity in answering questions about whether this or the other organism is or is not conscious. As usual, axioms are ways of making formal statements of intuitive beliefs and looking, again formally, at the consequences of such beliefs. The (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  40.  50
    An Indian solution to 'incompleteness'.U. A. Vinaya Kumar - 2009 - AI and Society 24 (4):351-364.
    Kurt Gödel’s Incompleteness theorem is well known in Mathematics/Logic/Philosophy circles. Gödel was able to find a way for any given P (UTM), (read as, “P of UTM” for “Program of Universal Truth Machine”), actually to write down a complicated polynomial that has a solution iff (=if and only if), G is true, where G stands for a Gödel-sentence. So, if G’s truth is a necessary condition for the truth of a given polynomial, then P (UTM) has to answer first that (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  41.  10
    Inconsistent Models for Relevant Arithmetics.Robert Meyer & Chris Mortensen - 2021 - Australasian Journal of Logic 18 (5):380-400.
    This paper develops in certain directions the work of Meyer in [3], [4], [5] and [6] (see also Routley [10] and Asenjo [11]). In those works, Peano’s axioms for arithmetic were formulated with a logical base of the relevant logic R, and it was proved finitistically that the resulting arithmetic, called R♯, was absolutely consistent. It was pointed out that such a result escapes incau- tious formulations of Goedel’s second incompleteness theorem, and provides a basis for a revived (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  42. Proof Theory of Finite-valued Logics.Richard Zach - 1993 - Dissertation, Technische Universität Wien
    The proof theory of many-valued systems has not been investigated to an extent comparable to the work done on axiomatizatbility of many-valued logics. Proof theory requires appropriate formalisms, such as sequent calculus, natural deduction, and tableaux for classical (and intuitionistic) logic. One particular method for systematically obtaining calculi for all finite-valued logics was invented independently by several researchers, with slight variations in design and presentation. The main aim of this report is to develop the (...) theory of finite-valued first order logics in a general way, and to present some of the more important results in this area. In Systems covered are the resolution calculus, sequent calculus, tableaux, and natural deduction. This report is actually a template, from which all results can be specialized to particular logics. (shrink)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  43.  32
    Models & Proofs: LFIs Without a Canonical Interpretations.Eduardo Alejandro Barrio - 2018 - Principia: An International Journal of Epistemology 22 (1):87-112.
    In different papers, Carnielli, W. & Rodrigues, A., Carnielli, W. Coniglio, M. & Rodrigues, A. and Rodrigues & Carnielli, present two logics motivated by the idea of capturing contradictions as conflicting evidence. The first logic is called BLE and the second—that is a conservative extension of BLE—is named LETJ. Roughly, BLE and LETJ are two non-classical logics in which the Laws of Explosion and Excluded Middle are not admissible. LETJ is built on top of BLE. Moreover, LETJ is a Logic (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  44.  33
    Proof and disproof in formal logic: an introduction for programmers.Richard Bornat - 2005 - New York: Oxford University Press.
    Proof and Disproof in Formal Logic is a lively and entertaining introduction to formal logic providing an excellent insight into how a simple logic works. Formal logic allows you to check a logical claim without considering what the claim means. This highly abstracted idea is an essential and practical part of computer science. The idea of a formal system-a collection of rules and axioms, which define a universe of logical proofs-is what gives us programming (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  45.  57
    Putnam, Peano, and the Malin Génie: could we possibly bewrong about elementary number-theory?Christopher Norris - 2002 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 33 (2):289-321.
    This article examines Hilary Putnam's work in the philosophy of mathematics and - more specifically - his arguments against mathematical realism or objectivism. These include a wide range of considerations, from Gödel's incompleteness-theorem and the limits of axiomatic set-theory as formalised in the Löwenheim-Skolem proof to Wittgenstein's sceptical thoughts about rule-following, Michael Dummett's anti-realist philosophy of mathematics, and certain problems – as Putnam sees them – with the conceptual foundations of Peano arithmetic. He also adopts a thought-experimental approach (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  46.  80
    Short proofs of normalization for the simply- typed λ-calculus, permutative conversions and Gödel's T.Felix Joachimski & Ralph Matthes - 2003 - Archive for Mathematical Logic 42 (1):59-87.
    Inductive characterizations of the sets of terms, the subset of strongly normalizing terms and normal forms are studied in order to reprove weak and strong normalization for the simply-typed λ-calculus and for an extension by sum types with permutative conversions. The analogous treatment of a new system with generalized applications inspired by generalized elimination rules in natural deduction, advocated by von Plato, shows the flexibility of the approach which does not use the strong computability/candidate style à la Tait (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  47. A relative consistency proof.Joseph R. Shoenfield - 1954 - Journal of Symbolic Logic 19 (1):21-28.
    LetCbe an axiom system formalized within the first order functional calculus, and letC′ be related toCas the Bernays-Gödel set theory is related to the Zermelo-Fraenkel set theory. Ilse Novak [5] and Mostowski [8] have shown that, ifCis consistent, thenC′ is consistent. Mostowski has also proved the stronger result that any theorem ofC′ which can be formalized inCis a theorem ofC.The proofs of Novak and Mostowski do not provide a direct method for obtaining a contradiction inCfrom a contradiction inC′. (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  48.  53
    The theory of classes A modification of von Neumann's system.Raphael M. Robinson - 1937 - Journal of Symbolic Logic 2 (1):29-36.
    1. The theory of classes presented in this paper is a simplification of that presented by J. von Neumann in his paper Die Axiomatisierung der Mengenlehre. However, this paper is written so that it can be read independently of von Neumann's. The principal modifications of his system are the following.(1) The idea of ordered pair is defined in terms of the other primitive concepts of the system. (See Axiom 4.3 below.)(2) A much simpler proof of the well-ordering theorem, based (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  49.  33
    The Anti-Mechanist Argument Based on Gödel’s Incompleteness Theorems, Indescribability of the Concept of Natural Number and Deviant Encodings.Paula Quinon - 2020 - Studia Semiotyczne 34 (1):243-266.
    This paper reassesses the criticism of the Lucas-Penrose anti-mechanist argument, based on Gödel’s incompleteness theorems, as formulated by Krajewski : this argument only works with the additional extra-formal assumption that “the human mind is consistent”. Krajewski argues that this assumption cannot be formalized, and therefore that the anti-mechanist argument – which requires the formalization of the whole reasoning process – fails to establish that the human mind is not mechanistic. A similar situation occurs with a corollary to the argument, (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  50. The gödel paradox and Wittgenstein's reasons.Francesco Berto - 2009 - Philosophia Mathematica 17 (2):208-219.
    An interpretation of Wittgenstein’s much criticized remarks on Gödel’s First Incompleteness Theorem is provided in the light of paraconsistent arithmetic: in taking Gödel’s proof as a paradoxical derivation, Wittgenstein was drawing the consequences of his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. It is shown that the features of (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   9 citations  
1 — 50 / 996