This book develops arithmetic without the induction principle, working in theories that are interpretable in Raphael Robinson's theory Q. Certain inductive formulas, the bounded ones, are interpretable in Q. A mathematically strong, but logically very weak, predicative arithmetic is constructed. Originally published in 1986. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These paperback editions preserve the original texts of these important books (...) while presenting them in durable paperback editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905. (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)

Real-world information is imperfect and is usually described in natural language (NL). Moreover, this information is often partially reliable and a degree of reliability is also expressed in NL. In view of this, the concept of a Z-number is a more adequate concept for the description of real-world information. The main critical problem that naturally arises in processing Z-numbers-based information is the computation with Z-numbers. Nowadays, there is no arithmetic of Z-numbers suggested in existing literature. This book is the (...) first to present a comprehensive and self-contained theory of Z-arithmetic and its applications. Many of the concepts and techniques described in the book, with carefully worked-out examples, are original and appear in the literature for the first time. The book will be helpful for professionals, academics, managers and graduate students in fuzzy logic, decision sciences, artificial intelligence, mathematical economics, and computational economics. (shrink)

All arithmetical identities involving 1, addition, multiplication and exponentiation will be true in a 2-element model of Tarski's system if a certain sequence of natural numbers is not bounded. That sequence can be bounded only if the set of Fermat's prime numbers is finite.

In this article, the relationship between second-order comprehension and unrestricted mereological fusion (over atoms) is clarified. An extension PAF of Peano arithmetic with a new binary mereological notion of “fusion”, and a scheme of unrestricted fusion, is introduced. It is shown that PAF interprets full second-order arithmetic, Z_2.

Proof-theoretic reflection principles are schemas which attempt to express the soundness of arithmetical theories within their own language, e.g., ${\mathtt{{Prov}_{\mathsf {PA}} \rightarrow \varphi }}$ can be understood to assert that any statement provable in Peano arithmetic is true. It has been repeatedly suggested that justification for such principles follows directly from acceptance of an arithmetical theory $\mathsf {T}$ or indirectly in virtue of their derivability in certain truth-theoretic extensions thereof. This paper challenges this consensus by exploring relationships between reflection (...) principles and principles of mathematical and transfinite induction as well as the status of the latter with respect to various foundational characterizations of number theory. (shrink)

Arithmetical definability has been extensively studied over the natural numbers. In this paper, we take up the study of arithmetical definability over finite structures, motivated by the correspondence between uniform AC0 and FO. We prove finite analogs of three classic results in arithmetical definability, namely that < and TIMES can first-order define PLUS, that < and DIVIDES can first-order define TIMES, and that < and COPRIME can first-order define TIMES. The first result sharpens the equivalence FO =FO to FO = (...) FO, answering a question raised by Barrington et al. about the Crane Beach Conjecture. Together with previous results on the Crane Beach Conjecture, our results imply that FO is strictly less expressive than FO = FO = FO. In more colorful language, one could say that, for parallel computation, multiplication is harder than addition. (shrink)

In Entailment, Anderson and Belnap motivated their modification E of Ackermann’s strenge Implikation Π Π’ as a logic of relevance and necessity. The kindred system R was seen as relevant but not as modal. Our systems of Peano arithmetic R# and omega arithmetic R## were based on R to avoid fallacies of relevance. But problems arose as to which arithmetic sentences were (relevantly) true. Here we base analogous systems on E to solve those problems. Central to motivating (...) E is the rejection of fallacies of modality. Our slogan here for this is, “No diamonds entail any boxes.” Form the strenge Peano arithmetic E# like R#, adding appropriate forms of the Peano axioms to Ackermann’s E.. (shrink)

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 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)

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, ...

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 prove that the finite-model version of arithmetic with the divisibility relation is undecidable . Additionally we prove FM-representability theorem for this class of finite models. This means that a relation R on natural numbers can be described correctly on each input on almost all finite divisibility models if and only if R is of degree ≤0′. We obtain these results by interpreting addition and multiplication on initial segments of finite models with divisibility only.

The purpose of this paper is to formulate first-order Peano arithmetic within the resources of relevant logic, and to demonstrate certain properties of the system thus formulated. Striking among these properties are the facts that it is trivial that relevant arithmetic is absolutely consistent, but classical first-order Peano arithmetic is straightforwardly contained in relevant arithmetic. Under, I shall show in particular that 0 = 1 is a non-theorem of relevant arithmetic; this, of course, is exactly (...) the formula whose unprovability was sought in the Hilbert program for proving arithmetic consistent. Under, I shall exhibit the requisite translation, drawing some Goedelian conclusions therefrom. Left open, however, is the critical problem whether Ackermann’s rule γ is admissible for theories of relevant arithmetic. The particular system of relevant Peano arithmetic featured in this paper shall be called R♯. Its logical base shall be the system R of relevant implication, taken in its first-order form RQ. Among other Peano arithmetics we shall consider here in particular the systems C♯, J♯, and RM3♯; these are based respectively on the classical logic C, the intuitionistic logic J, and the Sobocinski-Dunn semi-relevant logic RM3. And another feature of the paper will be the presentation of a system of natural deduction for R♯, along lines valid for first-order relevant theories in general. This formulation of R♯ makes it possible to construct relevantly valid arithmetical deductions in an easy and natural way; it is based on, but is in some respects more convenient than, the natural deduction formulations for relevant logics developed by Anderson and Belnap in Entailment. (shrink)

Kripke's Wittgenstein on Rules and Private Language has enlivened recent discussion of Wittgenstein's later philosophy. Yet it is quite possible to disengage his interpretive thesis from its supporting argumentation. Doing so leaves one with an intriguing sceptical argument which Kripke first powerfully advances, then tries to halt. But contrary to the impression his argument may leave, Kripke's solution and the position it concedes to the Sceptic are deeply allied. Here I shall demonstrate their common assumption, and on that basis argue (...) that Kripke's solution begs the Sceptic's question. Furthermore, I believe we can live with the Sceptic. The sceptical argument can be turned into a reasonable contribution to a kind of nominalism in the philosophy of meaning and truth. (shrink)

We define theories of bounded arithmetic, whose definable functions and relations are exactly those in certain complexity classes. Based on a recursion-theoretic characterization of NC in Clote , the first-order theory TNC, whose principal axiom scheme is a form of short induction on notation for nondeterministic polynomial-time computable relations, has the property that those functions having nondeterministic polynomial-time graph Θ such that TNC x y Θ are exactly the functions in NC, computable on a parallel random-access machine in polylogarithmic (...) parallel time with a polynomial number of processors.0 We then define three theories of weak second-order arithmetic which respectively characterize relations in the classes of alternating logarithmic time, logspace and nondeterministic logspace. (shrink)

Number theory abounds with conjectures asserting that every natural number has some arithmetic property. An example is Goldbach’s Conjecture, which states that every even number greater than 2 is the sum of two primes. Enumerative inductive evidence for such conjectures usually consists of small cases. In the absence of supporting reasons, mathematicians mistrust such evidence for arithmetical generalisations, more so than most other forms of non-deductive evidence. Some philosophers have also expressed scepticism about the value of enumerative inductive evidence (...) in arithmetic. But why? Perhaps the best argument is that known instances of an arithmetical conjecture are almost always small: they appear at the start of the natural number sequence. Evidence of this kind consequently suffers from size bias. My essay shows that this sort of scepticism comes in many different flavours, raises some challenges for them all, and explores their respective responses. (shrink)

With the arrival of the nineteenth century, a process of change guided the treatment of three basic elements in the development of mathematics: rigour, the arithmetization and the clarification of the concept of function, categorised as the most important tool in the development of the mathematical analysis. In this paper we will show how several prominent mathematicians contributed greatly to the development of these basic elements that allowed the solid underpinning of mathematics and the consideration of mathematics as an axiomatic (...) way of thinking in which anyone can deduce valid conclusions from certain types of premises. This nineteenth century stage shares, possibly with the Heroic Age of Ancient Greece, the most revolutionary period in all history of mathematics. (shrink)

Presburger arithmetic is the first-order theory of the natural numbers with addition. We characterize sets that can be defined by a Presburger formula as exactly the sets whose characteristic functions can be represented by rational generating functions; a geometric characterization of such sets is also given. In addition, ifp= are a subset of the free variables in a Presburger formula, we can define a counting functiong to be the number of solutions to the formula, for a givenp. We show (...) that every counting function obtained in this way may be represented as, equivalently, either a piecewise quasi-polynomial or a rational generating function. Finally, we translate known computational complexity results into this setting and discuss open directions. (shrink)

In The Consistency of Arithmetic and elsewhere, Meyer claims to “repeal” Goedel’s second incompleteness theorem. In this paper, I review his argument, and then consider two ways of understanding it: from the perspective of mathematical pluralism and monism, respectively. Is relevant arithmetic just another legitimate practice among many, or is it a rival of its classical counterpart—a corrective to Goedel, setting us back on the path to the (One) True Arithmetic? To help answer, I sketch a few (...) worked examples from relevant mathematics, to see what a non-classical (re)formulation of mathematics might look like in practice. I conclude that, while it is unlikely that relevant arithmetic describes past and present mathematical practice, and so might be most acceptable as a pluralist enterprise, it may yet prescribe a more monistic future venture. (shrink)

Philosophers of science since Nagel have been interested in the links between intertheoretic reduction and explanation, understanding and other forms of epistemic progress. Although intertheoretic reduction is widely agreed to occur in pure mathematics as well as empirical science, the relationship between reduction and explanation in the mathematical setting has rarely been investigated in a similarly serious way. This paper examines an important particular case: the reduction of arithmetic to set theory. I claim that the reduction is unexplanatory. In (...) defense of this claim, I offer evidence from mathematical practice, and I respond to contrary suggestions due to Steinhart, Maddy, Kitcher and Quine. I then show how, even if set-theoretic reductions are generally not explanatory, set theory can nevertheless serve as a legitimate foundation for mathematics. Finally, some implications of my thesis for philosophy of mathematics and philosophy of science are discussed. In particular, I suggest that some reductions in mathematics are probably explanatory, and I propose that differing standards of theory acceptance might account for the apparent lack of unexplanatory reductions in the empirical sciences. (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.

The paper presents an outline of the general theory of countable arithmetically saturated models of PA and some of its applications. We consider questions concerning the automorphism group of a countable recursively saturated model of PA. We prove new results concerning fixed point sets, open subgroups, and the cofinality of the automorphism group. We also prove that the standard system of a countable arithmetically saturated model of PA is determined by the lattice of its elementary substructures.

This is the only work to provide a histori­cal account of Kant’s theory of arith­metic, examining in detail the theories of both his predecessors and his successors.

This paper provides examples in arithmetic of the account of rational intuition and evidence developed in my book After Gödel: Platonism and Rationalism in Mathematics and Logic . The paper supplements the book but can be read independently of it. It starts with some simple examples of problem-solving in arithmetic practice and proceeds to general phenomenological conditions that make such problem-solving possible. In proceeding from elementary ‘authentic’ parts of arithmetic to axiomatic formal arithmetic, the paper exhibits (...) some elements of the genetic analysis of arithmetic knowledge that is called for in Husserl’s philosophy. This issues in an elaboration on a number of Gödel’s remarks about the meaning of his incompleteness theorems for the notion of evidence in mathematics. (shrink)

We will introduce a partial ordering $\preceq_1$ on the class of ordinals which will serve as a foundation for an approach to ordinal notations for formal systems of set theory and second-order arithmetic. In this paper we use $\preceq_1$ to provide a new characterization of the ubiquitous ordinal $\epsilon _{0}$.

This is a republication of R.K. Meyer's "Relevant Arithmetic", which originally appeared in the Bulletin of the Section of Logic 5. It sets out the problems that Meyer was to work on for the next decade concerning his system, R#.

The popular idea that mental calculation involves covert operations as counterparts to the scribblings, sayings or manipulations involved in classroom calculation is rejected by familiar arguments in Section I. Philosophers do not readily agree on an alternative account. Section II considers reasons why they are puzzled, reasons which encourage a return to the discredited position. The currently fashionable Causal or Functionalist view is criticised in Section III. Section IV reconsiders the stubborn fact that when someone calculates in their head they (...) do something at the time which explains their arithmetical successes or failures. Some dispositional descriptions are rejected as inadequate. Though a restrained dispositionalism is finally supported, it does not have the implication that nothing was going on in the silence. (shrink)

We prove that for each recursively axiomatized consistent extension T of Peano Arithmetic and \, there exists a \ numeration \\) of T such that the provability logic of the provability predicate \\) naturally constructed from \\) is exactly \ \rightarrow \Box p\). This settles Sacchetti’s problem affirmatively.

In this paper we study the interpretations of a weak arithmetic, like Buss’s theory $\mathsf{S}^{1}_{2}$, in a given theory $U$. We call these interpretations the arithmetics of $U$. We develop the basics of the structure of the arithmetics of $U$. We study the provability logic of $U$ from the standpoint of the framework of the arithmetics of $U$. Finally, we provide a deeper study of the arithmetics of a finitely axiomatized sequential theory.

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)

Results on arithmetical complexity of important sets of formulas of several fuzzy predicate logics are surveyed and some new results are proven.

We prove that the finite‐model version of arithmetic with the divisibility relation is undecidable (more precisely, it has Π01‐complete set of theorems). Additionally we prove FM‐representability theorem for this class of finite models. This means that a relation R on natural numbers can be described correctly on each input on almost all finite divisibility models if and only if R is of degree ≤0′. We obtain these results by interpreting addition and multiplication on initial segments of finite models with (...) divisibility only. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim). (shrink)

Taking up ordinal notations derived from Skolem hull operators familiar in the field of infinitary proof theory we develop a toolkit of ordinal arithmetic that generally applies whenever ordinal structures are analyzed whose combinatorial complexity does not exceed the strength of the system of set theory. The original purpose of doing so was inspired by the analysis of ordinal structures based on elementarity invented by T.J. Carlson, see [T.J. Carlson, Elementary patterns of resemblance, Annals of Pure and Applied Logic (...) 108 19–77], [G. Wilken, Σ1-Elementarity and Skolem hull operators, Annals of Pure and Applied Logic 145 162–175], and [G. Wilken, Assignment of ordinals to patterns of resemblance, The Journal of Symbolic Logic ]. Within the arithmetical context laid bare in this work, the “-numbers” play a role analogous to the role epsilon numbers play in the ordinal arithmetic based on the notion of Cantor normal form. (shrink)

The incompleteness of formal systems for arithmetic has been a recognized fact of mathematics. The term “incompleteness” suggests that the formal system in question fails to offer a deduction which it ought to. This chapter focuses on the status of a formal system, Peano Arithmetic, and explores a viewpoint on which Peano Arithmetic occupies an intrinsic, conceptually well-defined region of arithmetical truth. The idea is that it consists of those truths which can be perceived directly from the (...) purely arithmetical content of a categorical conceptual analysis of the notion of natural number. The chapter explores its conceptual stability in light of the apparently destabilizing effect, through extensibility, of the phenomenon of incompleteness. It also offers heuristic and conceptual support for the viewpoint that Peano Arithmetic is the strongest natural first-order system for arithmetic, and that there is a sense in which it is complete with respect to purely arithmetical truth. (shrink)

It can be argued that only the equational theories of some sub-elementary function algebras are finitistic or intuitive according to a certain interpretation of Hilbert's conception of intuition. The purpose of this paper is to investigate the relation of those restricted forms of equational reasoning to classical quantifier logic in arithmetic. The conclusion reached is that Edward Nelson's ‘predicative arithmetic’ program, which makes essential use of classical quantifier logic, cannot be justified finitistically and thus requires a different philosophical (...) foundation, possibly as a restricted form of logicism. (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)

It is proved in this paper that the predicate logic of each complete constructive arithmetic theory T having the existential property is Π1T-complete. In this connection, the techniques of a uniform partial truth definition for intuitionistic arithmetic theories is used. The main theorem is applied to the characterization of the predicate logic corresponding to certain variant of the notion of realizable predicate formula. Namely, it is shown that the set of irrefutable predicate formulas is recursively isomorphic to the (...) complement of the set ︀. The notion of Σn-realizability is defined on the basis of the notion of Σn-function. It is proved that the predicate logic of Σn-realizability is Πω+1-hard. (shrink)

Allen, B., Arithmetizing Uniform NC, Annals of Pure and Applied Logic 53 1–50. We give a characterization of the complexity class Uniform NC as an algebra of functions on the natural numbers which is the closure of several basic functions under composition and a schema of recursion. We then define a fragment of bounded arithmetic, and, using our characterization of Uniform NC, show that this fragment is capable of proving the totality of all of the functions in Uniform NC. (...) Lastly, in the spirit of Buss, we show that any function which is definable by a ∑b1-formula in our theory is a function which is in Uniform NC. (shrink)

The revival of the philosophy of mathematics in the 60s following its post-1931 slump left us with two conflicting positions on arithmetic’s ontological relationship to set theory. W.V. Quine’s view, presented in 'Word and Object' (1960), was that numbers are sets. The opposing view was advanced in another milestone of twentieth-century philosophy of mathematics, Paul Benacerraf’s 'What Numbers Could Not Be' (1965): one of the things numbers could not be, it explained, was sets; the other thing numbers could not (...) be, even more dramatically, was objects. Curiously, although Benacerraf’s article appeared in the heyday of Quine’s influence, it declined to engage the Quinean position squarely, even seemed to think it was not its business to do so. Despite that, in my experience, most philosophers believe that Benacerraf’s article put paid to the reductionist view that numbers are sets (though perhaps not the view that numbers are objects). My chapter will attempt to overturn this orthodoxy. (shrink)

We assess Meyer’s formalization of arithmetic in his [21], based on the strong relevant logic R and compare this with arithmetic based on a suitable logic of meaning containment, which was developed in Brady [7]. We argue in favour of the latter as it better captures the key logical concepts of meaning and truth in arithmetic. We also contrast the two approaches to classical recapture, again favouring our approach in [7]. We then consider our previous development of (...) Peano arithmetic including primitive recursive functions, finally extending this work to that of general recursion. (shrink)

Research on dyscalculia in neurodegenerative diseases is still scarce, despite high impact on patients’ independence and activities of daily living function. Most studies address Alzheimer’s Disease; however, patients with Parkinson’s Disease also have a higher risk for cognitive impairment while the relation to arithmetic deficits in financial contexts has rarely been studied. Therefore, the current exploratory study investigates deficits in two simple arithmetic tasks in financial contexts administered within the Clinical Dementia Rating in a sample of 100 PD (...) patients. Patients were classified as cognitively normal or mildly impaired according to Level I consensus criteria, and assessed using a comprehensive neuropsychological test battery, neurological motor examination, and sociodemographic and clinical questionnaires. In total, 18% showed arithmetic deficits: they were predominately female, had longer disease duration, more impaired global cognition, but minor signs of depression compared to PD patients without arithmetic deficits. When correcting for clinical and sociodemographic confounders, greater impairments in attention and visuo-spatial/constructional domains predicted occurrence of arithmetic deficits. The type of deficit did not seem to be arbitrary but seemed to involve impaired place × value processing frequently. Our results argue for the importance of further systematic investigations of arithmetic deficits in PD with sensitive tests to confirm the results of our exploratory study that a specific subgroup of PD patients present themselves with dyscalculia. (shrink)

By a theorem of R. Kaye, J. Paris and C. Dimitracopoulos, the class of the Πn+1-sentences true in the standard model is the only consistent Πn+1-theory which extends the scheme of induction for parameter free Πn+1-formulas. Motivated by this result, we present a systematic study of extensions of bounded quantifier complexity of fragments of first-order Peano Arithmetic. Here, we improve that result and show that this property describes a general phenomenon valid for parameter free schemes. As a consequence, we (...) obtain results on the quantifier complexity, finite axiomatizability and relative strength of schemes for Δn+1-formulas. (shrink)

We employ the lens provided by formal truth theory to study axiomatizations of Peano Arithmetic ${\textsf {(PA)}}$. More specifically, let Elementary Arithmetic ${\textsf {(EA)}}$ be the fragment $\mathsf {I}\Delta _0 + \mathsf {Exp}$ of ${\textsf {PA}}$, and let ${\textsf {CT}}^-[{\textsf {EA}}]$ be the extension of ${\textsf {EA}}$ by the commonly studied axioms of compositional truth ${\textsf {CT}}^-$. We investigate both local and global properties of the family of first order theories of the form ${\textsf {CT}}^-[{\textsf {EA}}] +\alpha $, (...) where $\alpha $ is a particular way of expressing “ ${\textsf {PA}}$ is true” (using the truth predicate). Our focus is dominantly on two types of axiomatizations, namely: (1) schematic axiomatizations that are deductively equivalent to ${\textsf {PA}}$ and (2) axiomatizations that are proof-theoretically equivalent to the canonical axiomatization of ${\textsf {PA}}$. (shrink)

An arithmetical interpretation of dynamic propositional logic (DPL) is a mapping f satisfying the following: (1) f associates with each formula A of DPL a sentence f(A) of Peano arithmetic (PA) and with each program α a formula f(α) of PA with one free variable describing formally a supertheory of PA; (2) f commutes with logical connectives; (3) f([α] A) is the sentence saying that f(A) is provable in the theory f(α); (4) for each axiom A of DPL, f(A) (...) is provable in PA (and consequently, for each A provable in DPL, f(A) is provable in PA). The arithmetical completeness theorem is proved saying that a formula A of DPL is provable in DPL iff for each arithmetical interpretation f, f(A) is provable in PA. Various modifications of this result are considered. (shrink)