Online research in philosophy

In this paper, I pursue such a logical foundation for arithmetic in a variant of Zermelo set theory that has axioms of subset separation only for quantifier-free formulae, and according to which all sets are Dedekind finite. In section 2, I describe this variant theory, which I call ZFin0. And in section 3, I sketch foundations for arithmetic in ZFin0 and prove that certain foundational propositions that are theorems of the standard Zermelian foundation for arithmetic are independent (...) of ZFin0.<br><br>An equivalent theory of sets and an equivalent foundation for arithmetic was introduced by John Mayberry and developed by the current author in his doctoral thesis. In that thesis, the independence results mentioned above are proved using proof-theoretic methods. In this paper, I offer model-theoretic proofs of the central independence results using the technique of cumulation models, which was introduced by Steve Popham, a doctoral student of Mayberry<br>from the early 1980s. (shrink)

In 'On interpretations of arithmetic and set theory', Kaye and Wong proved the following result, which they considered to belong to the folklore of mathematical logic.

THEOREM 1 The first-order theories of Peano arithmetic and Zermelo-Fraenkel set theory with the axiom of infinity negated are bi-interpretable.

In this note, I describe a theory of sets that is bi-interpretable with the theory of bounded arithmetic IDelta0 + exp. Because of the weakness of this theory of sets, I cannot straightforwardly adapt (...) Kaye and Wong's interpretation of the arithmetic in the set theory. Instead, I am forced to produce a different interpretation. (shrink)

In arithmetic, if only because many of its methods and concepts originated in India, it has been the tradition to reason less strictly than in geometry, ...

We show how second order logic incompleteness follows from incompleteness of arithmetic, as proved by Gödel.

This article discusses the properties of a controllable, flexible, hybrid parallel computing architecture that potentially merges pattern recognition and arithmetic. Humans perform integer arithmetic in a fundamentally different way than logic-based computers. Even though the human approach to arithmetic is both slow and inaccurate it can have substantial advantages when useful approximations ( intuition ) are more valuable than high precision. Such a computational strategy may be particularly useful when computers based on nanocomponents become feasible because it (...) offers a way to make use of the potential power of these massively parallel systems. Because the system architecture is inspired by neuroscience and is applied to cognitive problems, occasional mention is made of experimental data from both fields when appropriate. (shrink)

This is a critical examination of the astonishing progress made in the philosophical study of the properties of the natural numbers from the 1880s to the 1930s. Reassessing the brilliant innovations of Frege, Russell, Wittgenstein, and others, which transformed philosophy as well as our understanding of mathematics, Michael Potter places arithmetic at the interface between experience, language, thought, and the world.

This is a dialogue in the philosophy of mathematics that focuses on these issues: Are the Peano axioms for arithmetic epistemologically irrelevant? What is the source of our knowledge of these axioms? What is the epistemological relationship between arithmetical laws and the particularities of number?

Given a classical theory T, a Kripke model K for the language L of T is called T-normal or locally PA just in case the classical L-structure attached to each node of K is a classical model of T. Van Dalen, Mulder, Krabbe, and Visser showed that Kripke models of Heyting Arithmetic (HA) over finite frames are locally PA, and that Kripke models of HA over frames ordered like the natural numbers contain infinitely many PA-nodes. We show that Kripke (...) models of the latter sort are in fact PA-normal. This result is extended to a somewhat larger class of frames. (shrink)

We observe that the classification problem for countable models of arithmetic is Borel complete. On the other hand, the classification problems for finitely generated models of arithmetic and for recursively saturated models of arithmetic are Borel; we investigate the precise complexity of each of these. Finally, we show that the classification problem for pairs of recursively saturated models and for automorphisms of a fixed recursively saturated model are Borel complete.

Alberto Casullo ("Necessity, Certainty, and the A Priori", Canadian Journal of Philosophy 18, 1988) argues that arithmetical propositions could be disconfirmed by appeal to an invented scenario, wherein our standard counting procedures indicate that 2 + 2 != 4. Our best response to such a scenario would be, Casullo suggests, to accept the results of the counting procedures, and give up standard arithmetic. While Casullo's scenario avoids arguments against previous "disconfirming" scenarios, it founders on the assumption, common to scenario (...) and response, that arithmetic might be independent of standard counting procedures. Here I show, by attention to tallying as the simplest form of counting, that this assumption is incoherent: given standard counting procedures, then (on pain of irrationality) arithmetical theory follows. 1. (shrink)

We define a new theory of concatenation WTC which is much weaker than Grzegorczyk's well-known theory TC. We prove that WTC is mutually interpretable with the weak theory of arithmetic R. The latter is, in a technical sense, much weaker than Robinson's arithmetic Q, but still essentially undecidable. Hence, as a corollary, WTC is also essentially undecidable.

The paper presents four open problems concerning recursively saturated models of Peano Arithmetic. One problems concerns a possible converse to Tarski's undefinability of truth theorem. The other concern elementary cuts in countable recursively saturated models, extending automorphisms of countable recursively saturated models, and Jonsson models of PA. Some partial answers are given.

A model $\mathscr{M} = (M,+,\times, 0,1,<)$ of Peano Arithmetic $({\sf PA})$ is boundedly saturated if and only if it has a saturated elementary end extension $\mathscr{N}$. The ordertypes of boundedly saturated models of $({\sf PA})$ are characterized and the number of models having these ordertypes is determined. Pairs $(\mathscr{N},M)$, where $\mathscr{M} \prec_{\sf end} \mathscr{N} \models({\sf PA})$ for saturated $\mathscr{N}$, and their theories are investigated. One result is: If $\mathscr{N}$ is a $\kappa$-saturated model of $({\sf PA})$ and $\mathscr{M}_0, \mathscr{M}_1 \prec_{\sf (...) end} \mathscr{N}$ are such that $\aleph_1 \leq \mathrm{min}(\mathrm{cf}(M_0),\mathrm{dcf}(M_0)) \leq \mathrm{min}(\mathrm{cf}(M_1), \mathrm{dcf}(M_1)) < \kappa$, then $(\mathscr{N},M_0) \equiv (\mathscr{N},M_1)$. (shrink)

Is calculation possible without language? Or is the human ability for arithmetic dependent on the language faculty? To clarify the relation between language and arithmetic, we studied numerical cognition in speakers of Mundurukú, an Amazonian language with a very small lexicon of number words. Although the Mundurukú lack words for numbers beyond 5, they are able to compare and add large approximate numbers that are far beyond their naming range. However, they fail in exact arithmetic with numbers (...) larger than 4 or 5. Our results imply a distinction between a nonverbal system of number approximation and a language-based counting system for exact number and arithmetic. (shrink)

§ i. After deserting for a time the old Euclidean standards of rigour, mathematics is now returning to them, and even making efforts to go beyond them. ...

Russell held that the theory of natural numbers could be derived from three primitive concepts: number, successor and zero. This leaves out multiplication and addition. Russell introduces these concepts by recursive definition. It is argued that this does not render addition or multiplication any less primitive than the other three. To this it might be replied that any recursive definition can be transformed into a complete or explicit definition with the help of a little set theory. But that is a (...) point about set theory, not number theory. (shrink)

Michael Friedman maintains that Carnap did not fully appreciate the impact of Gödel's first incompleteness theorem on the prospect for a purely syntactic definition of analyticity that would render arithmetic analytically true. This paper argues against this claim. It also challenges a common presumption on the part of defenders of Carnap, in their diagnosis of the force of Gödel's own critique of Carnap in his Gibbs Lecture. The author is grateful to Michael Friedman for valuable comments. Part of the (...) research towards this paper was carried out while the author was a Visiting Fellow at the Center for Philosophy of Science at the University of Pittsburgh. The paper was presented to the Center's Fellowship Reunion Conference in Athens in 1992. It was committed for publication in the Proceedings of that conference, but those Proceedings never appeared. By the time it became evident that they would never appear, both the hard copy and the source file had been mislaid. The hard copy re-surfaced in 2007. The literature on this topic since 1992 appears to leave some space for the ideas and arguments presented here. Although the paper has been updated in light of the more recent literature, its basic thesis, presented in 1992, remains the same. Only 3 is new, questioning a basic presumption made by more recent commentators in their presentation of Gödel's criticism of Carnap in his Gibbs Lecture. For helpful comments on the current version, the author is indebted to Robert Kraut, Stewart Shapiro, and Adam Podlaskowski. CiteULike Connotea Del.icio.us What's this? (shrink)

... as 'logicism') that the content expressed by true propositions of arithmetic and analysis is not something of an irreducibly mathematical character, ...

Officially, for Kant, judgments are analytic iff the predicate is "contained in" the subject. I defend the containment definition against the common charge of obscurity, and argue that arithmetic cannot be analytic, in the resulting sense. My account deploys two traditional logical notions: logical division and concept hierarchies. Division separates a genus concept into exclusive, exhaustive species. Repeated divisions generate a hierarchy, in which lower species are derived from their genus, by adding differentia(e). Hierarchies afford a straightforward sense of (...) containment: genera are contained in the species formed from them. Kant's thesis then amounts to the claim that no concept hierarchy conforming to division rules can express truths like '7+5=12.' Kant is correct. Operation concepts ( ) bear two relations to number concepts: and are inputs, is output. To capture both relations, hierarchies must posit overlaps between concepts that violate the exclusion rule. Thus, such truths are synthetic. (shrink)

The paper presents a proof of the consistency of Peano Arithmetic (PA) that does not lie in deducing its consistency as a theorem in an axiomatic system. PA’s consistency cannot be proved in PA, and to deduce its consistency in some stronger system PA+ is self-defeating, since the stronger system may itself be inconsistent. Instead, a semantic proof is constructed which demonstrates consistency not relative to the consistency of some other system but in an absolute sense.

I here investigate the sense in which diagonalization allows one to construct sentences that are self-referential. Truly self-referential sentences cannot be constructed in the standard language of arithmetic: There is a simple theory of truth that is intuitively inconsistent but is consistent with Peano arithmetic, as standardly formulated. True self-reference is possible only if we expand the language to include function-symbols for all primitive recursive functions. This language is therefore the natural setting for investigations of self-reference.

Using an axiomatization of second-order arithmetic (essentially second-order Peano Arithmetic without the Successor Axiom), arithmetic's basic operations are defined and its fundamental laws, up to unique prime factorization, are proven. Two manners of expressing a system's consistency are presented - the "Godel" consistency, where a wff is represented by a natural number, and the "real" consistency, where a wff is represented as a second-order sequence, which is a stronger notion. It is shown that the system can prove (...) at least its Godel consistency and that closely allied systems can prove their real consistency. (shrink)

Frege Arithmetic (FA) is the second-order theory whose sole non-logical axiom is Hume’s Principle, which says that the number of F s is identical to the number of Gs if and only if the F s and the Gs can be one-to-one correlated. According to Frege’s Theorem, FA and some natural definitions imply all of second-order Peano Arithmetic. This paper distinguishes two dimensions of impredicativity involved in FA—one having to do with Hume’s Principle, the other, with the underlying (...) second-order logic—and investigates how much of Frege’s Theorem goes through in various partially predicative fragments of FA. Theorem 1 shows that almost everything goes through, the most important exception being the axiom that every natural number has a successor. Theorem 2 shows that the Successor Axiom cannot be proved in the theories that are predicative in either dimension. (shrink)

Kant’s theory of arithmetic is not only a central element in his theoretical philosophy but also an important contribution to the philosophy of arithmetic as such. However, modern mathematics, especially non-Euclidean geometry, has placed much pressure on Kant’s theory of mathematics. But objections against his theory of geometry do not necessarily correspond to arguments against his theory of arithmetic and algebra. The goal of this article is to show that at least some important details in Kant’s theory (...) of arithmetic can be picked up, improved by reconstruction and defended under a contemporary perspective: the theory of numbers as products of rule following construction presupposing successive synthesis in time and the theory of arithmetic equations, sentences or “formulas”—as Kant says—as synthetic a priori. In order to do so, two calculi in terms of modern mathematics are introduced which formalise Kant’s theory of addition as a form of synthetic operation. (shrink)

Herein is presented a natural first-order arithmetic system which can prove its own consistency, both in the weaker Godelian sense using traditional Godel numbering and, more importantly, in a more robust and direct sense; yet it is strong enough to prove many arithmetic theorems, including the Euclidean Algorithm, Quadratic Reciprocity, and Bertrand’s Postulate.

The philosophy of arithmetic of Wittgenstein's Tractatus is outlined and the central role played in it by the general notion of operation is pointed out. Following which, the language, the axioms and the rules of a formal theory of operations, extracted from the Tractatus, are presented and a theorem of interpretability of the equational fragment of Peano's Arithmetic into such a formal theory is proven.

The goal of the research programme I describe in this article is a realist epistemology for arithmetic which respects arithmetic's special epistemic status (the status usually described as a prioricity) yet accommodates naturalistic concerns by remaining fundamentally empiricist. I argue that the central claims which would allow us to develop such an epistemology are (i) that arithmetical truths are known through an examination of our arithmetical concepts; (ii) that (at least our basic) arithmetical concepts are accurate mental representations (...) of elements of the arithmetical structure of the independent world; (iii) that (ii) obtains in virtue of the normal functioning of our sensory apparatus. The first of these claims protects arithmetic's special epistemic status relative, for example, to the laws of physics, the second preserves the independence of arithmetical truth, and the third ensures that we remain empiricists. Preliminaries Justifying and grounding concepts Cameras and filters An epistemology for arithmetic Concluding remarks. (shrink)

This paper develops some respects in which the philosophy of mathematics can fruitfully be informed by mathematical practice, through examining Frege's Grundlagen in its historical setting. The first sections of the paper are devoted to elaborating some aspects of nineteenth century mathematics which informed Frege's early work. (These events are of considerable philosophical significance even apart from the connection with Frege.) In the middle sections, some minor themes of Grundlagen are developed: the relationship Frege envisions between arithmetic and geometry (...) and the way in which the study of reasoning is to illuminate this. In the final section, it is argued that the sorts of issues Frege attempted to address concerning the character of mathematical reasoning are still in need of a satisfying answer. (shrink)

General Arithmetic is the theory consisting of induction on a successor function. Normal arithmetic, say in the system called Peano Arithmetic, makes certain additional demands on the successor function. First, that it be total. Secondly, that it be one-to-one. And thirdly, that there be a first element which is not in its image. General Arithmetic abandons all of these further assumptions, yet is still able to prove many meaningful arithmetic truths, such as, most basically, Commutativity (...) and Associativity of Addition and Multiplication, but also Lagrange’s Four-Square Theorem. Adding one more axiom, the one-oneness of succession, one can prove many more theorems, such as Quadratic Reciprocity and Fermat’s Little Theorem. By looking at arithmetic in this general setting, one receives a deeper understanding of the underlying structures. (shrink)

The purpose of this note is to demonstrate that predicative Frege arithmetic naturally interprets some weak but non-trivial arithmetical theories. The weak theories in question are all related to Tarski, Mostowski, and Robinson's R. In saying that the interpretation is "natural", I mean that it relies only upon "definitions" of arithmetical notions that are themselves "natural", that is, that have some claim to be "definitions" in something other than a purely formal sense.

Using a slight generalization, due to Palmgren, of sheaf semantics, we present a term-model construction that assigns a model to any first-order intuitionistic theory. A modification of this construction then assigns a nonstandard model to any theory of arithmetic, enabling us to reproduce conservation results of Moerdijk and Palmgren for nonstandard Heyting arithmetic. Internalizing the construction allows us to strengthen these results with additional transfer rules; we then show that even trivial transfer axioms or minor strengthenings of these (...) rules destroy conservativity over HA. The analysis also shows that nonstandard HA has neither the disjunction property nor the explicit definability property. Finally, careful attention to the complexity of our definitions allows us to show that a certain weak fragment of intuitionistic nonstandard arithmetic is conservative over primitive recursive arithmetic. (shrink)

is a fragment of first-order aritlimetic so weak that it cannot prove the totality of an iterated exponential fimction. Surprisingly, however, the theory is remarkably robust. I will discuss formal results that show that many theorems of number theory and combinatorics are derivable in elementary arithmetic, and try to place these results in a broader philosophical context.

Øystein Linnebo has recently shown that the existence of successors cannot be proven in predicative Frege arithmetic, using Frege’s definitions of arithmetical notions. By contrast, it is shown here that the existence of successor can be proven in ramified predicative Frege arithmetic.

Predicative mathematics in the sense originating with Poincar´ e and Weyl begins by taking the natural number system for granted, proceeding immediately to real analysis and related fields. On the other hand, from a logicist or set-theoretic standpoint, this appears problematic, for, as the story is usually told, impredicative principles seem to play an essential role in the foundations of arithmetic itself.1 It is the main purpose of this paper to show that this appearance is illusory: as will emerge, (...) a predicatively acceptable axiomatization of the natural number system can be formulated, and both the existence of structures of the relevant type and the categoricity of the relevant axioms can be proved in a predicatively acceptable way. (shrink)

In this paper I present a formalist philosophy mathematics and apply it directly to Arithmetic. I propose that formalists concentrate on presenting compositional truth theories for mathematical languages that ultimately depend on formal methods. I argue that this proposal occupies a lush middle ground between traditional formalism, fictionalism, logicism and realism.

Theorem 1. If T is a sound formalized theory whose language contains the language of basic arithmetic, then there will be a true sentence GT of basic arithmetic such that T ￿ GT and ￿ ¬GT, so T must be negation incomplete.

In the third Logical Investigation Husserl presents an integrated theory of wholes and parts based on the notions of dependency, foundation ( Fundierung ), and aprioricity. Careful examination of the literature reveals misconceptions regarding the meaning and scope of the central axis of this theory, especially with respect to its proper context within the development of Husserl's thought. The present paper will establish this context and in the process correct a number of these misconceptions. The presentation of mereology in the (...) Logical Investigations will be shown to originate largely from Husserl's implicit self-criticism of his prior views on the unity of a whole presented in his first work, Philosophy of Arithmetic. (shrink)

Last spring, as I was beginning a graduate seminar on Frege, I received a complimentary copy of this new translation of his masterwork, The Foundations of Arithmetic . I had ordered Austin's famous translation, well-loved for the beauty of its English and the clarity with which it presents Frege's overall argument, but known to be less than literal, and to sometimes supplement translation with interpretation. I was intrigued by Dale Jacquette's promise "to combine literal accuracy and readability for beginning (...) students and professional scholars alike," and to improve on Austin where the latter "does not always faithfully represent or seem to perfectly understand certain of Frege's German idioms." (v) Such a translation, complete with index, critical introduction, and commentary, and at a bargain price, seemed worthy of my students' attention. So, I mentioned to the class that this book might be worth looking into. (shrink)

Presented here is a new result concerning the computational power of so-called SADn computers, a class of Turing-machine-based computers that can perform some non-Turing computable feats by utilising the geometry of a particular kind of general relativistic spacetime. It is shown that SADn can decide n-quantifier arithmetic but not (n+1)-quantifier arithmetic, a result that reveals how neatly the SADn family maps into the Kleene arithmetical hierarchy. Introduction Axiomatising computers The power of SAD computers Remarks regarding the concept of (...) computability. (shrink)

I try to reconstruct how Frege thought to reconcile the cognitive value of arithmetic with its analytical nature. There is evidence in Frege's texts that the epistemological formulation of the context principle plays a decisive role; it provides a way of obtaining concepts which are truly fruitful and whose contents cannot be grasped beforehand. Taking the definitions presented in the Begriffsschrift,I shall illustrate how this schema is intended to work.

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 does (...) prove each of the now standard Dedekind-Peano axioms, his proofs are devoted primarily to the derivation of his own axioms for arithmetic, which are somewhat different (though of course equivalent). These axioms, which may be yet more intuitive than the Dedekind-Peano axioms, may be taken to be "The Basic Laws of Cardinal Number", as Frege understood them. Though the axioms of arithmetic have been known to be derivable from Hume's Principle for about ten years now, it has not been widely recognized that Frege himself showed them so to be; nor has it been known that Frege made use of any axiomatization for arithmetic whatsoever. Grundgesetze is thus a work of much greater significance than has often been thought. First, Frege's use of the inconsistent Axiom V may invalidate certain of his claims regarding the philosophical significance of his work (viz., the establishment of Logicism), but it should not be allowed to obscure his mathematical accomplishments and his contribution to our understanding of arithmetic. Second, Frege's knowledge that arithmetic is derivable from Hume's Principle raises important sorts of questions about his philosophy of arithmetic. For example, "Why did Frege not simply abandon Axiom V and take Hume's Principle as an axiom?". (shrink)

Second-order Peano Arithmetic minus the Successor Axiom is developed from first principles through Quadratic Reciprocity and a proof of self-consistency. This paper combines 4 other papers of the author in a self-contained exposition.

A new second-order axiomatization of arithmetic, with Frege's definition of successor replaced, is presented and compared to other systems in the field of Frege Arithmetic. The key in proving the Peano Axioms turns out to be a proposition about infinity, which a reduced subset of the axioms proves.

I make an attempt at the description of the delicate role of the standard model of arithmetic for the syntax of formal systems. I try to assess whether the possible instability in the notion of finiteness deriving from the nonstandard interpretability of arithmetic affects the very notions of syntactic metatheory and of formal system. I maintain that the crucial point of the whole question lies in the evaluation of the phenomenon of formalization. The ideas of Skolem, Zermelo, Beth (...) and Carnap (among others) on the problem are discussed. ‘A tries to explain to B the meaning of negation. Finally A gives up, saying: “You don’t understand what I mean, and I am not going to explain any longer,” to which B replies: “Yes, I see what you mean, and I am glad you are willing to continue your explanations”’. G. Mannoury, reported by E. W. Beth (Beth, 1963, 489). (shrink)

This paper presents a defense of Epistemic Arithmetic as used for a formalization of intuitionistic arithmetic and of certain informal mathematical principles. First, objections by Allen Hazen and Craig Smorynski against Epistemic Arithmetic are discussed and found wanting. Second, positive support is given for the research program by showing that Epistemic Arithmetic can give interesting formulations of Church's Thesis.

The paper concerns interpretations of the paraconsistent logic LP which model theories properly containing all the sentences of first order arithmetic. The paper demonstrates the existence of such models and provides a complete taxonomy of the finite ones.

First-order Peano Arithmetic (PA) is incomplete. The question naturally arises: what kind of sentences of PA’s language LA (that’s ‘the language of basic arithmetic’, with the standard interpretation) can we establish to be true even though they are unprovable in PA?

Argues that classical arithmetic can be viewed as a proper part of intuitionistic arithmetic. Suggests that this largely neutralizes Dummett's argument for intuitionism in the case of arithmetic.

In this paper some of the history of the development of arithmetic in set theory is traced, particularly with reference to the problem of avoiding the assumption of an infinite set. Although the standard method of singling out a sequence of sets to be the natural numbers goes back to Zermelo, its development was more tortuous than is generally believed. We consider the development in the light of three desiderata for a solution and argue that they can probably not (...) all be satisfied simultaneously. (shrink)

We characterize the collapse of Buss' bounded arithmetic in terms of the provable collapse of the polynomial time hierarchy. We include also some general model-theoretical investigations on fragments of bounded arithmetic.

In a short, technical note, the system of arithmetic, F, introduced in Systems for a Foundation of Arithmetic and "True" Arithmetic Can Prove Its Own Consistency and Proving Quadratic Reciprocity, is demonstrated to be equivalent to a sub-theory of Peano Arithmetic; the sub-theory is missing, most notably, the Successor Axiom.

Machine generated contents note: 1. Introduction Juliette Kennedy and Roman Kossak; 2. Historical remarks on Suslin's problem Akihiro Kanamori; 3. The continuum hypothesis, the generic-multiverse of sets, and the [OMEGA] conjecture W. Hugh Woodin; 4. [omega]-Models of finite set theory Ali Enayat, James H. Schmerl and Albert Visser; 5. Tennenbaum's theorem for models of arithmetic Richard Kaye; 6. Hierarchies of subsystems of weak arithmetic Shahram Mohsenipour; 7. Diophantine correct open induction Sidney Raffer; 8. Tennenbaum's theorem and recursive reducts (...) James H. Schmerl; 9. History of constructivism in the 20th century A. S. Troelstra; 10. A very short history of ultrafinitism Rose M. Cherubin and Mirco A. Mannucci; 11. Sue Toledo's notes of her conversations with Gödel in 1972-1975 Sue Toledo; 12. Stanley Tennenbaum's Socrates Curtis Franks; 13. Tennenbaum's proof of the irrationality of [the square root of] 2́. (shrink)

IN Hilbert's theory of the foundations of any given branch of mathematics the main problem is to establish the consistency (of a suitable formalisation) of this branch. Since the (intuitionist) criticisms of classical logic, which Hilbert's theory was intended to meet, never even alluded to inconsistencies (in classical arithmetic), and since the investigations of Hilbert's school have always established much more than mere consistency, it is natural to formulate another general problem in the foundations of mathematics: to translate statements (...) of theorems and proofs in the branch considered into those of some preferred system, where the translation must satisfy certain appropriate conditions (interpretation). The problem is relative to the choice of preferred system, as is Hilbert's consistency problem since he required the consistency to be established by particular methods (finitist ones). A finitist interpretation of classical number theory, which has been published in full detail elsewhere, is here described by means of typical examples. Partial results on analysis (theory of arbitrary functions whose arguments and values are the non-negative integers) are here presented for the first time. One of these results is restricted to functions whose values are bounded; its interest derives from the fact that real numbers may be represented by such functions. It is hoped that diverse general observations and comments, which would bore the specialist, may be of help to the general reader. The specialist may find some points of interest in the last two sections of the main text and in the notes following it. (shrink)

The system R## of true relevant arithmetic is got by adding the -rule Infer xAx from A0, A1, A2, .... to the system R# of relevant Peano arithmetic. The rule E (or gamma) is admissible for R##. This contrasts with the counterexample to E for R# (Friedman & Meyer, Whither Relevant Arithmetic). There is a Way Up part of the proof, which selects an arbitrary non-theorem C of R## and which builds by generalizing Henkin and Belnap arguments (...) a prime theory T which still lacks C. (The key to the Way Up is a Witness Protection Program, using the -rule.) But T may be TOO BIG, whence there is a Way Down argument that produces a better theory TR, such that R## TR T. (The key to the Way Down is a Metavaluation, on which membership in T is combined with ordinary truth-functional conditions to determine TR.) The result is a theory that is Just Right, whence it never happens that A C and A are theorems of R## but C is a non-theorem. (shrink)

Classifies accounts of arithmetic into four sorts according to the resources they appeal to in constructing its subject matter.

Since there are non-sortal predicates Frege’s attempt to derive Arithmetic from Logic stumbles at its very first step. There are properties without a number, so the contingency of that condition shows Frege’s definition of zero is not obtainable from Logic. But Frege made a crucial mistake about concepts more generally which must be remedied, before we can be clear about those specific concepts which are numbers.

In “Truth – A Traditional Debate Reviewed” (1999), Crispin Wright proposed an inductive definition of “coherence truth” for arithmetic relative to an arithmetic base theory B. Wright’s definition is in fact a notational variant of the usual Tarskian inductive definition, except for the basis clause for atomic sentences. This paper provides a model-theoretic characterization of the resulting sets of sentences "cohering" with a given base theory B. These sets are denoted WB. Roughly, if B satisfies a certain minimal (...) condition (for each term t, B proves an equation of the form t = n, where n is a numeral), then WB is the Th(M), where M is the canonical model of the set At(B) of atomic sentences provable in B. The paper also shows that the disquotational T-scheme is provable (in a metatheory T) from Wright’s inductive definition just in case the base theory B is (provably in T) sound and complete for arithmetic atomic sentences. (shrink)

The paper establishes the general structure of the inconsistent models of arithmetic of [7]. It is shown that such models are constituted by a sequence of nuclei. The nuclei fall into three segments: the first contains improper nuclei; the second contains proper nuclei with linear chromosomes; the third contains proper nuclei with cyclical chromosomes. The nuclei have periods which are inherited up the ordering. It is also shown that the improper nuclei can have the order type of any ordinal, (...) of the rationals, or of any other order type that can be embedded in the rationals in a certain way. (shrink)

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 arithmetic. In particular, F proves some (but not all) of the Peano Axioms; that is, F proves the axioms of a sub-theory - call it FPA - of second-order Peano-Arithmetic. This short technical note will demonstrate that the converse also holds, in the following sense. F has the same language as second-order Peano Arithmetic except that, in addition, it has a two-place predicate symbol “Μ”. Then it is possible to provide a definition, indeed a reasonable definition, for “Μ” such that FPA proves all the axioms of F. So F and FPA effectively have the same proof-theoretic strength. In particular FPA, which lacks the Successor Axiom stating that every natural number has a successor, is able to prove the Euclidean Algorithm, Unique Prime Factorization, and Quadratic Reciprocity, indeed (again) a sizable amount of arithmetic. (shrink)

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 the Church (...) numerals. Given a new definition of equality all the Peano-type axioms of Mendelson except one can be derived. A rather weak extra axiom allows the proof of the remaining Peano axiom. Note. The illative combinatory logic used in this paper is similar to the logic employed in computer languages such as ML. (shrink)

If $M \models PA (= Peano Arithmetic)$ , we set $A^M = \{N \subset_e M: N \models PA\}$ and study this family.

A proof of the (propositional) Craig interpolation theorem for cut-free sequent calculus yields that a sequent with a cut-free proof (or with a proof with cut-formulas of restricted form; in particular, with only analytic cuts) with k inferences has an interpolant whose circuit-size is at most k. We give a new proof of the interpolation theorem based on a communication complexity approach which allows a similar estimate for a larger class of proofs. We derive from it several corollaries: (1) Feasible (...) interpolation theorems for the following proof systems: (a) resolution (b) a subsystem of LK corresponding to the bounded arithmetic theory S 2 2 (α) (c) linear equational calculus (d) cutting planes. (2) New proofs of the exponential lower bounds (for new formulas) (a) for resolution ([15]) (b) for the cutting planes proof system with coefficients written in unary ([4]). (3) An alternative proof of the independence result of [43] concerning the provability of circuit-size lower bounds in the bounded arithmetic theory S 2 2 (α). In the other direction we show that a depth 2 subsystem of LK does not admit feasible monotone interpolation theorem (the so called Lyndon theorem), and that a feasible monotone interpolation theorem for the depth 1 subsystem of LK would yield new exponential lower bounds for resolution proofs of the weak pigeonhole principle. (shrink)

I show that any sentence of nth-order (pure or applied) arithmetic can be expressed with no loss of compositionality as a second-order sentence containing no arithmetical vocabulary, and use this result to prove a completeness theorem for applied arithmetic. More specifically, I set forth an enriched second-order language L, a sentence A of L (which is true on the intended interpretation of L), and a compositionally recursive transformation Tr defined on formulas of L, and show that they have (...) the following two properties: (a) in a universe with at least [HEBREW LETTER BET] $_{n-2}$ objects, any formula of nth-order (pure or applied) arithmetic can be expressed as a formula of L, and (b) for any sentence $\ulcorner \phi \urcorner$ of L, $\ulcorner \phi^{Tr} \urcorner$ is a second-order sentence containing no arithmetical vocabulary, and nth $\mathcal{A} \vdash \ulcorner \phi \longleftrightarrow \phi^{Tr} \urcorner$. (shrink)

A new method of "minimal" realizability is proposed and applied to show that the definable functions of Heyting arithmetic (HA)--functions f such that HA $\vdash \forall x\exists!yA(x, y)\Rightarrow$ for all m, A(m, f(m)) is true, where A(x, y) may be an arbitrary formula of L(HA) with only x, y free--are precisely the provably recursive functions of the classical Peano arithmetic (PA), i.e., the $ -recursive functions. It is proved that, for prenex sentences provable in HA, Skolem functions may (...) always be chosen to be $ -recursive. The method is extended to intuitionistic finite-type arithmetic, HA ω 0 , and elementary analysis. Generalized forms of Kreisel's characterization of the provably recursive functions of PA and of the no-counterexample-interpretation for PA are consequently derived. (shrink)

Based on the relevant logic R, the system R# was proposed as a relevant Peano arithmetic. R# has many nice properties: the most conspicuous theorems of classical Peano arithmetic PA are readily provable therein; it is readily and effectively shown to be nontrivial; it incorporates both intuitionist and classical proof methods. But it is shown here that R# is properly weaker than PA, in the sense that there is a strictly positive theorem QRF of PA which is unprovable (...) in R#. The reason is interesting: if PA is slightly weakened to a subtheory P+, it admits the complex ring C as a model; thus QRF is chosen to be a theorem of PA but false in C. Inasmuch as all strictly positive theorems of R# are already theorems of P+, this nonconservativity result shows that QRF is also a nontheorem of R#. As a consequence, Ackermann's rule γ is inadmissible in R#. Accordingly, an extension of R# which retains its good features is desired. The system R##, got by adding an omega-rule, is such an extension. Central question: is there an effectively axiomatizable system intermediate between R# and R##, which does formalize arithmetic on relevant principles, but also admits γ in a natural way? (shrink)

Symbolic arithmetic is fundamental to science, technology and economics, but its acquisition by children typically requires years of effort, instruction and drill1,2. When adults perform mental arithmetic, they activate nonsymbolic, approximate number representations3,4, and their performance suffers if this nonsymbolic system is impaired5. Nonsymbolic number representations also allow adults, children, and even infants to add or subtract pairs of dot arrays and to compare the resulting sum or difference to a third array, provided that only approximate accuracy is (...) required6–10. Here we report that young children, who have mastered verbal counting and are on the threshold of arithmetic instruction, can build on their nonsymbolic number system to perform symbolic addition and subtraction11–15. Children across a broad socio-economic spectrum solved symbolic problems involving approximate addition or subtraction of large numbers, both in a laboratory test and in a school setting. Aspects of symbolic arithmetic therefore lie within the reach of children who have learned no algorithms for manipulating numerical symbols. Our findings help to delimit the sources of children’s difficulties learning symbolic arithmetic, and they suggest ways to enhance children’s engagement with formal mathematics. We presented children with approximate symbolic arithmetic problems in a format that parallels previous tests of non-symbolic arithmetic in preschool children8,9. In the first experiment, five- to six-year-old children were given problems such as ‘‘If you had twenty-four stickers and I gave you twenty-seven more, would you have more or less than thirty-five stickers?’’. Children performed well above chance (65.0%, t1952.77, P 5 0.012) without resorting to guessing or comparison strategies that could serve as alternatives to arithmetic. Children who have been taught no symbolic arithmetic therefore have some ability to perform symbolic addition problems. The children’s performance nevertheless fell short of performance on non-symbolic arithmetic tasks using equivalent addition problems with numbers presented as arrays of dots and with the addition operation conveyed by successive motions of the dots into a box (71.3% correct, F1,345 4.26, P 5 0.047)8.. (shrink)

An epistemic formalization of arithmetic is constructed in which certain non-trivial metatheoretical inferences about the system itself can be made. These inferences involve the notion of provability in principle, and cannot be made in any consistent extensions of Stewart Shapiro's system of epistemic arithmetic. The system constructed in the paper can be given a modal-structural interpretation.

Various authors of logic texts are cited who either suggest or explicitly state that the Gödel incompleteness result shows that some unprovable sentence of arithmetic is true. Against this, the paper argues that the matter is one of philosophical controversy, that it is not a mathematical or logical issue.

We show that each of the five basic theories of second order arithmetic that play a central role in reverse mathematics has a natural counterpart in the language of nonstandard arithmetic. In the earlier paper [3] we introduced saturation principles in nonstandard arithmetic which are equivalent in strength to strong choice axioms in second order arithmetic. This paper studies principles which are equivalent in strength to weaker theories in second order arithmetic.

Philosophers have recently expressed interest in accounting for the usefulness of mathematics to science. However, it is certainly not a new concern. Putnam and Quine have each worked out an argument for the existence of mathematical objects from the indispensability of mathematics to science. Were Quine or Putnam to disregard the applicability of mathematics to science, he would not have had as strong a case for platonism. But I think there must be ways of parsing mathematical sentences which account for (...) applicability of mathematics and also do not require us to believe in entities we have no evidence for, other than through reading these sentences literally. We will explore a particular way to interpret sentences of arithmetic which promises to account for their applicability without bringing in metaphysics not also brought in by science. The investigation will be limited to the arithmetic of cardinal numbers. The general strategy is to argue for the analogy between arithmetic and science, rather than to argue for one case having a particular characteristic independently of the other. (shrink)

We investigate the theory IΔ 0 + Ω 1 and strengthen [Bu86. Theorem 8.6] to the following: if NP ≠ co-NP. then Σ-completeness for witness comparison formulas is not provable in bounded arithmetic. i.e. $I\delta_0 + \Omega_1 + \nvdash \forall b \forall c (\exists a(\operatorname{Prf}(a.c) \wedge \forall = \leq a \neg \operatorname{Prf} (z.b))\\ \rightarrow \operatorname{Prov} (\ulcorner \exists a(\operatorname{Prf}(a. \bar{c}) \wedge \forall z \leq a \neg \operatorname{Prf}(z.\bar{b})) \urcorner)).$ Next we study a "small reflection principle" in bounded arithmetic. We prove (...) that for all sentences φ $I\Delta_0 + \Omega_1 \vdash \forall x \operatorname{Prov}(\ulcorner \forall y \leq \bar{x} (\operatorname{Prf} (y. \overline{\ulcorner \varphi \urcorner}) \rightarrow \varphi)\urcorner).$ The proof hinges on the use of definable cuts and partial satisfaction predicates akin to those introduced by Pudlak in [Pu86]. Finally, we give some applications of the small reflection principle, showing that the principle can sometimes be invoked in order to circumvent the use of provable Σ-completeness for witness comparison formulas. (shrink)

This paper continues the investigation of inconsistent arithmetical structures. In $\S2$ the basic notion of a model with identity is defined, and results needed from elsewhere are cited. In $\S3$ several nonisomorphic inconsistent models with identity which extend the (=, $\S4$ inconsistent nonstandard models of the classical theory of finite rings and fields modulo m, i.e. Z m , are briefly considered. In $\S5$ two models modulo an infinite nonstandard number are considered. In the first, it is shown how to (...) model inconsistently the arithmetic of the rationals with all names included, a strengthening of earlier results. In the second, all inconsistency is confined to the nonstandard integers, and the effects on Fermat's Last Theorem are considered. It is concluded that the prospects for a good inconsistent theory of fields may be limited. (shrink)

In this paper I begin by extending two results of Solovay; the first characterizes the possible Turing degrees of models of True Arithmetic (TA), the complete first-order theory of the standard model of PA, while the second characterizes the possible Turing degrees of arbitrary completions of P. I extend these two results to characterize the possible Turing degrees of m-diagrams of models of TA and of arbitrary complete extensions of PA. I next give a construction showing that the conditions (...) Solovay identified for his characterization of degrees of models of arbitrary completions of PA cannot be dropped (I showed that these conditions cannot be simplified in the paper. (shrink)

We show that certain model-theoretic forcing arguments involving subsystems of second-order arithmetic can be formalized in the base theory, thereby converting them to effective proof-theoretic arguments. We use this method to sharpen conservation theorems of Harrington and Brown-Simpson, giving an effective proof that W KL+0 is conservative over RCA0 with no significant increase in the lengths of proofs.

Working within weak subsystems of second-order arithmetic Z2 we consider two versions of the Baire Category theorem which are not equivalent over the base system RCA0. We show that one version (B.C.T.I) is provable in RCA0 while the second version (B.C.T.II) requires a stronger system. We introduce two new subsystems of Z2, which we call RCA+ 0 and WKL+ 0, and show that RCA+ 0 suffices to prove B.C.T.II. Some model theory of WKL+ 0 and its importance in view (...) of Hilbert's program is discussed, as well as applications of our results to functional analysis. (shrink)

Two experiments were conducted to investigate children’s interpretations of standard arithmetic word problems and the factors that influence their interpretations. In Experiment 1, children were required to solve a series of problems and then to draw and select pictures that represented the problems’ structures. Solution performance was found to vary systematically with the nature of the representations drawn and chosen. The crucial determinant of solution success was the interpretation a child assigned to certain phrases used in the problems. In (...) Experiment 2, solution and drawing accuracy were found to be significantly improved by rewording problems to avoid ambiguous linguistic forms. Together, these results imply that (a) word-problem solution errors are caused by misinterpretations of certain verbal expressions commonly used in problem texts, and (b) these misinterpretations are the result of missing or inadequate mappings of these verbal expressions to partwhole knowledge. (shrink)

We discuss the philosophical status of the statement that (9n – 1) is divisible by 8 for various sizes of the number n. We argue that even this simple problem reveals deep tensions between truth and verification. Using Gillies's empiricist classification of theories into levels, we propose that statements in arithmetic should be classified into three different levels depending on the sizes of the numbers involved. We conclude by discussing the relationship between the real number system and the physical (...) continuum. (shrink)

In his monograph On Numbers and Games, J. H. Conway introduced a real-closed field containing the reals and the ordinals as well as a great many less familiar numbers including -ω, ω/2, 1/ω, \sqrt{ω} and ω-π to name only a few. Indeed, this particular real-closed field, which Conway calls No, is so remarkably inclusive that, subject to the proviso that numbers—construed here as members of ordered fields—be individually definable in terms of sets of NBG (von Neumann—Bernays—Gödel set theory with global (...) choice), it may be said to contain “All Numbers Great and Small.” In this respect, No bears much the same relation to ordered fields that the system ℝ of real numbers bears to Archimedean ordered fields. In Part I of the present paper, we suggest that whereas ℝ should merely be regarded as constituting an arithmetic continuum (modulo the Archimedean axiom), No may be regarded as a sort of absolute arithmetic continuum (modulo NBG), and in Part II we draw attention to the unifying framework No provides not only for the reals and the ordinals but also for an array of non-Archimedean ordered number systems that have arisen in connection with the theories of non-Archimedean ordered algebraic and geometric systems, the theory of the rate of growth of real functions and nonstandard analysis. In addition to its inclusive structure as an ordered field, the system No of surreal numbers has a rich algebraico-tree-theoretic structure—a simplicity hierarchical structure—that emerges from the recursive clauses in terms of which it is defined. In the development of No outlined in the present paper, in which the surreals emerge vis-à-vis a generalization of the von Neumann ordinal construction, the simplicity hierarchical features of No are brought to the fore and play central roles in the aforementioned unification of systems of numbers great and small and in some of the more revealing characterizations of No as an absolute continuum. (shrink)

This is a sequel to our article “Predicative foundations of arithmetic” (1995), referred to in the following as [PFA]; here we review and clarify what was accomplished in [PFA], present some improvements and extensions, and respond to several challenges. The classic challenge to a program of the sort exemplified by [PFA] was issued by Charles Parsons in a 1983 paper, subsequently revised and expanded as Parsons (1992). Another critique is due to Daniel Isaacson (1987). Most recently, Alexander George and (...) Daniel Velleman (1996) have examined [PFA] closely in the context of a general discussion of different philosophical approaches to the foundations of arithmetic. (shrink)

We consider extensions of Peano arithmetic suitable for doing some of nonstandard analysis, in which there is a predicate N(x) for an elementary initial segment, along with axiom schemes approximating ω 1 -saturation. We prove that such systems have the same proof-theoretic strength as their natural analogues in second order arithmetic. We close by presenting an even stronger extension of Peano arithmetic, which is equivalent to ZF for arithmetic statements.

Presburger's essay on the completeness and decidability of arithmetic with integer addition but without multiplication is a milestone in the history of mathematical logic and formal metatheory. The proof is constructive, using Tarski-style quantifier elimination and a four-part recursive comprehension principle for axiomatic consequence characterization. Presburger's proof for the completeness of first order arithmetic with identity and addition but without multiplication, in light of the restrictive formal metatheorems of Gödel, Church, and Rosser, takes the foundations of arithmetic (...) in mathematical logic to the limits of completeness and decidability. (shrink)

A general method of interpreting weak higher-type theories of nonstandard arithmetic in their standard counterparts is presented. In particular, this provides natural nonstandard conservative extensions of primitive recursive arithmetic, elementary recursive arithmetic, and polynomial-time computable arithmetic. A means of formalizing basic real analysis in such theories is sketched.

A classical quantified modal logic is used to define a "feasible" arithmetic A 1 2 whose provably total functions are exactly the polynomial-time computable functions. Informally, one understands $\Box\alpha$ as "α is feasibly demonstrable". A 1 2 differs from a system A 2 that is as powerful as Peano Arithmetic only by the restriction of induction to ontic (i.e., $\Box$ -free) formulas. Thus, A 1 2 is defined without any reference to bounding terms, and admitting induction over formulas (...) having arbitrarily many alternations of unbounded quantifiers. The system also uses only a very small set of initial functions. To obtain the characterization, one extends the Curry-Howard isomorphism to include modal operations. This leads to a realizability translation based on recent results in higher-type ramified recursion. The fact that induction formulas are not restricted in their logical complexity, allows one to use the Friedman A translation directly. The development also leads us to propose a new Frege rule, the "Modal Extension" rule: if $\vdash \alpha$ then $\vdash A \leftrightarrow \alpha$ a for new symbol A. (shrink)

PA is Peano arithmetic. The formula $\operatorname{Interp}_\mathrm{PA}(\alpha, \beta)$ is a formalization of the assertion that the theory PA + α interprets the theory PA + β (the variables α and β are intended to range over codes of sentences of PA). We extend Solovay's modal analysis of the formalized provability predicate of PA, Pr PA (x), to the case of the formalized interpretability relation $\operatorname{Interp}_\mathrm{PA}(x, y)$ . The relevant modal logic, in addition to the usual provability operator `□', has (...) a binary operator ` $\triangleright$ ' to be interpreted as the formalized interpretability relation. We give an axiomatization and a decision procedure for the class of those modal formulas that express valid interpretability principles (for every assignment of the atomic modal formulas to sentences of PA). Our results continue to hold if we replace the base theory PA with Zermelo-Fraenkel set theory, but not with Gödel-Bernays set theory. This sensitivity to the base theory shows that the language is quite expressive. Our proof uses in an essential way earlier work done by A. Visser, D. de Jongh, and F. Veltman on this problem. (shrink)

We settle a question in the literature about degrees of models of true arithmetic and upper bounds for the arithmetic sets. We prove that there is a model of true arithmetic whose degree is not a uniform upper bound for the arithmetic sets. The proof involves two forcing constructions.

It has been known for more than thirty years that the degree of a non-standard model of true arithmetic is a subuniform upper bound for the arithmetic sets (suub). Here a notion of generic enumeration is presented with the property that the degree of such an enumeration is an suub but not the degree of a non-standard model of true arithmetic. This answers a question posed in the literature.

We study extensions of Presburger arithmetic with a unary predicate R and we show that under certain conditions on R, R is sparse (a notion introduced by A. L. Semenov) and the theory of $\langle\mathbb{N}, +, R\rangle$ is decidable. We axiomatize this theory and we show that in a reasonable language, it admits quantifier elimination. We obtain similar results for the structure $\langle\mathbb{Q},+, R\rangle$.

Unraveling all the mysteries of the khipu--the knotted string device used by the Inka to record both statistical data and narrative accounts of myths, histories, and genealogies--will require an understanding of how number values and relations may have been used to encode information on social, familial, and political relationships and structures. This is the problem Gary Urton tackles in his pathfinding study of the origin, meaning, and significance of numbers and the philosophical principles underlying the practice of arithmetic among (...) Quechua-speaking peoples of the Andes. Based on fieldwork in communities around Sucre, in south-central Bolivia, Urton argues that the origin and meaning of numbers were and are conceived of by Quechua-speaking peoples in ways similar to their ideas about, and formulations of, gender, age, and social relations. He also demonstrates that their practice of arithmetic is based on a well-articulated body of philosophical principles and values that reflects a continuous attempt to maintain balance, harmony, and equilibrium in the material, social, and moral spheres of community life. (shrink)

We develop fundamental aspects of the theory of metric, Hilbert, and Banach spaces in the context of subsystems of second-order arithmetic. In particular, we explore issues having to do with distances, closed subsets and subspaces, closures, bases, norms, and projections. We pay close attention to variations that arise when formalizing definitions and theorems, and study the relationships between them. For example, we show that a natural formalization of the mean ergodic theorem can be proved in ACA0; but even recognizing (...) the theorem’s “equivalent” existence assertions as such can also require the full strength of ACA0. (shrink)

In this paper two different formulations of Robinson's arithmetic based on relevant logic are examined. The formulation based on the natural numbers (including zero) is shown to collapse into classical Robinson's arithmetic, whereas the one based on the positive integers (excluding zero) is shown not to similarly collapse. Relations of these two formulations to R. K. Meyer's system R# of relevant Peano arithmetic are examined, and some remarks are made about the role of constant functions (e.g., multiplication (...) by zero) in relevant arithmetic. (shrink)

We give a simple proof characterizing the complexity of Presburger arithmetic augmented with additional predicates. We show that Presburger arithmetic with additional predicates is Π 1 1 complete. Adding one unary predicate is enough to get Π 1 1 hardness, while adding more predicates (of any arity) does not make the complexity any worse.

Let $\mathscr{L} = \{0, 1, +, \cdot, <\}$ be the usual first-order language of arithmetic. We show that Peano arithmetic is the least first-order L-theory containing IΔ0 + exp such that every complete extension T of it has a countable model K satisfying. (i) K has no proper elementary substructures, and (ii) whenever $L \prec K$ is a countable elementary extension there is $\bar{L} \prec L$ and $\bar{K} \subseteq_\mathrm{e} \bar{L}$ such that $K \prec_{\mathrm{cf}}\bar{K}$ . Other model-theoretic conditions similar (...) to (i) and (ii) are also discussed and shown to characterize Peano arithmetic. (shrink)

This book presents an up-to-date, unified treatment of research in bounded arithmetic and complexity of propositional logic, with emphasis on independence proofs and lower bound proofs. The author discusses the deep connections between logic and complexity theory and lists a number of intriguing open problems. An introduction to the basics of logic and complexity theory is followed by discussion of important results in propositional proof systems and systems of bounded arithmetic. More advanced topics are then treated, including polynomial (...) simulations and conservativity results, various witnessing theorems, the translation of bounded formulas (and their proofs) into propositional ones, the method of random partial restrictions and its applications, direct independence proofs, complete systems of partial relations, lower bounds to the size of constant-depth propositional proofs, the method of Boolean valuations, the issue of hard tautologies and optimal proof systems, combinatorics and complexity theory within bounded arithmetic, and relations to complexity issues of predicate calculus. Students and researchers in mathematical logic and complexity theory will find this comprehensive treatment an excellent guide to this expanding interdisciplinary area. (shrink)

Modifying the methods of Z. Adamowicz's paper Herbrand consistency and bounded arithmetic [3] we show that there exists a number n such that ⋃m Sm (the union of the bounded arithmetic theories Sm) does not prove the Herbrand consistency of the finitely axiomatizable theory $S_{3}^{n}$.

We investigate the modal logic of interpretability over Peano arithmetic. Our main result is a compactness theorem that extends the arithmetical completeness theorem for the interpretability logic ILM ω . This extension concerns recursively enumerable sets of formulas of interpretability logic (rather than single formulas). As corollaries we obtain a uniform arithmetical completeness theorem for the interpretability logic ILM and a partial answer to a question of Orey from 1961. After some simplifications, we also obtain Shavrukov's embedding theorem for (...) Magari algebras (a.k.a. diagonalizable algebras). (shrink)