Ernst Mayr argued that the emergence of biology as a special science in the early nineteenth century was possible due to the demise of the mathematical model of science and its insistence on demonstrative knowledge. More recently, John Zammito has claimed that the rise of biology as a special science was due to a distinctive experimental, anti-metaphysical, anti-mathematical, and anti-rationalist strand of thought coming from outside of Germany. In this paper we argue that this narrative neglects the important role played (...) by the mathematical and axiomatic model of science in the emergence of biology as a special science. We show that several major actors involved in the emergence of biology as a science in Germany were working with an axiomatic conception of science that goes back at least to Aristotle and was popular in mid-eighteenth-century German academic circles due to its endorsement by Christian Wolff. More specifically, we show that at least two major contributors to the emergence of biology in Germany—Caspar Friedrich Wolff and Gottfried Reinhold Treviranus—sought to provide a conception of the new science of life that satisfies the criteria of a traditional axiomatic ideal of science. Both C.F. Wolff and Treviranus took over strong commitments to the axiomatic model of science from major philosophers of their time, Christian Wolff and Friedrich Wilhelm Joseph Schelling, respectively. The ideal of biology as an axiomatic science with specific biological fundamental concepts and principles thus played a role in the emergence of biology as a special science. (shrink)

We propose two alternatives to Xu’s axiomatization of Chellas’s STIT. The first one simplifies its presentation, and also provides an alternative axiomatization of the deliberative STIT. The second one starts from the idea that the historic necessity operator can be defined as an abbreviation of operators of agency, and can thus be eliminated from the logic of Chellas’s STIT. The second axiomatization also allows us to establish that the problem of deciding the satisfiability of a STIT formula (...) without temporal operators is NP-complete in the single-agent case, and is NEXPTIME-complete in the multiagent case, both for the deliberative and Chellas’s STIT. (shrink)

We investigate axiomatizations of Kripke's theory of truth based on the Strong Kleene evaluation scheme for treating sentences lacking a truth value. Feferman's axiomatization KF formulated in classical logic is an indirect approach, because it is not sound with respect to Kripke's semantics in the straightforward sense: only the sentences that can be proved to be true in KF are valid in Kripke's partial models. Reinhardt proposed to focus just on the sentences that can be proved to be true (...) in KF and conjectured that the detour through classical logic in KF is dispensable. We refute Reinhardt's Conjecture, and provide a direct axiomatization PKF of Kripke's theory in partial logic. We argue that any natural axiomatization of Kripke's theory in Strong Kleene logic has the same proof-theoretic strength as PKF, namely the strength of the system RA< ωω ramified analysis or a system of Tarskian ramified truth up to ωω. Thus any such axiomatization is much weaker than Feferman's axiomatization KF in classical logic, which is equivalent to the system RA<ε₀ of ramified analysis up to ε₀. (shrink)

At the centre of the traditional discussion of truth is the question of how truth is defined. Recent research, especially with the development of deflationist accounts of truth, has tended to take truth as an undefined primitive notion governed by axioms, while the liar paradox and cognate paradoxes pose problems for certain seemingly natural axioms for truth. In this book, Volker Halbach examines the most important axiomatizations of truth, explores their properties and shows how the logical results impinge on the (...) philosophical topics related to truth. In particular, he shows that the discussion on topics such as deflationism about truth depends on the solution of the paradoxes. His book is an invaluable survey of the logical background to the philosophical discussion of truth, and will be indispensable reading for any graduate or professional philosopher in theories of truth. (shrink)

Formal aspects of various ways of description of Jan Łukasiewicz’s four-valued modal logic £ are discussed. The original Łukasiewicz’s description by means of the accepted and rejected theorems, together with the four-valued matrix, is presented. Then the improved E.J. Lemmon’s description based upon three specific axioms, together with the relational semantics, is presented as well. It is proved that Lemmon’s axiomatic is not independent: one axiom is derivable on the base of the remanent two. Several axiomatizations, based on three, two (...) or one single axiom are provided and discussed, including S. Kripke’s axiomatics. It is claimed that (a) all substitutions of classical theorems, (b) the rule of modus ponens, (c) the definition of “◊” and (d) the single specific axiom schema: ⬜A ∧ B → A ∧ ⬜B, called the jumping necessity axiom, constitute an elegant axiomatics of the system £. (shrink)

We present an axiomatization of non-relativistic Quantum Mechanics for a system with an arbitrary number of components. The interpretation of our system of axioms is realistic and objective. The EPR paradox and its relation with realism is discussed in this framework. It is shown that there is no contradiction between realism and recent experimental results.

The main aim of our paper was to present three formal tools for comparing various axiomatic theories of truth. In Section 2 we aimed at showing that there are indeed many different approaches to defining a set of axioms for the notion of truth. In Section 3 we introduced three different \measures of strength" of axiomatic theories of truth, i.e. three reflexive and transitive relations on the set of axiomatic theories of truth. We have explained the intuition behind each of (...) them. The three relations were called : Fujimoto definability, model-theoretical strength, proof-theoretical strength. Then in the last section we described how they order the truth theories introduced in Section 2. We observed that theories made equivalent by the coarser relation can be strictly ordered by the next one. (shrink)

This paper presents in outline Luigi Ferrajoli’s axiomatic and general theory of law, as developed in his lifelong work Principia Iuris . The first section focuses on the three main aspects of the theory: the methodological, the theoretical and the pragmatic, which respectively represent the theory’s syntax, semantics and its pragmatics. Ferrajoli identifies three deontic gaps of norms: firstly, the one between their validity and efficacy ; secondly, the one between their justice and validity ; and finally, and most importantly, (...) the one between validity and existence (i.e. normative force). The presence of such gaps is, according to Ferrajoli, the extraordinary innovation that entrenched constitutions have brought into modern legal systems, by establishing norms that are superior to statutes and case law. In this sense, all normative phenomena (except for the constitution itself) can be conceived both as norms and as facts. In the second section the role of juridical science is briefly discussed. (shrink)

This work treats the problem of axiomatizing the truth and falsity consequence relations, ⊨ t and ⊨ f, determined via truth and falsity orderings on the trilattice SIXTEEN 3 (Shramko and Wansing, 2005). The approach is based on a representation of SIXTEEN 3 as a twist-structure over the two-element Boolean algebra.

Specifies an axiomatization of the system S13 of modal logic. Referenced in Cocchiarella & Freund "Modal Logic: an Introduction to its Syntax and Semantics", Oxford University Press, 2008.

알베르투스는 형이상학을 모든 학문들의 원리를 제공하는 기초 학문으로, 그 연구 대상은 “가장 먼저 유출된 존재”로 이해한다. 그리고 공리적 방법으로 존재와 선의 관계를 규명한 보에티우스의 『데헵도마디부스』를 자신의 형이상학적 체계 내에서 핵심적인 요소로 수용한다. 제일원인이 만물의 단일한 근거이고 세계가 여기서 창조되었다는 사상은 공리들과 그것들로 조합된 다수의 학적 지식들의 논증 질서에 대응한다. 알베르투스는 『원인론』의 제일원인을 그 자신인 것을 산출하는 원인으로 이해하는데, 어떠한 원인도 가지지 않고 피조물과도 결합되지 않는다는 점이 제일원인의 본질적인 특성이다. 이를 알베르투스는 『원인론 주해』와 『형이상학 주해』에서 보에티우스의 네 가지 공리를 가지고 해명한다.본 (...) 논문은 알베르투스의 형이상학에서 공리적 방법(axiomatic method)이 어떻게 적용되는지를 분석하는 연구다. 특히, 보에티우스의 『데헵도마디부스』와 『원인론』이 알베르투스 형이상학의 공리적 틀을 형성하는 중요한 원천임을 규명한다. 기존연구들이 알베르투스주의자들의 사유에서 공리적 방법의 흔적을 찾는 데 집중했다면, 본 연구는 알베르투스 자신의 텍스트에서 이 방법론이 구체적으로 어떻게 나타나며, 그의 형이상학 체계를 형성하는 데 어떤 역할을 했는지에 주목했다. 알베르투스는 아리스토텔레스의 형이상학을 수용하면서도 프로클로스적인 요소, 즉 기하학적 방법론을 활용하여 존재의 근거를 공리적 구조로 정립한다. 이를 통해 알베르투스의 형이상학적 사유가 보에티우스와 『원인론』을 통해 어떻게 연역 체계로서 구성되었는지를 밝히고, 나아가 그의 사상이 근대 형이상학 발전에 미친 영향을 가늠하고자 한다. (shrink)

This paper sets out a new way of combining Kripke-complete modal logics: lexicographic product. It discusses some basic properties of the lexicographic product construction and proves axiomatization/completeness results.

In the literature, different axiomatizations of Public Announcement Logic (PAL) have been proposed. Most of these axiomatizations share a “core set” of the so-called “reduction axioms”. In this paper, by designing non-standard Kripke semantics for the language of PAL, we show that the proof system based on this core set of axioms does not completely axiomatize PAL without additional axioms and rules. In fact, many of the intuitive axioms and rules we took for granted could not be derived from the (...) core set. Moreover, we also propose and advocate an alternative yet meaningful axiomatization of PAL without the reduction axioms. The completeness is proved directly by a detour method using the canonical model where announcements are treated as merely labels for modalities as in normal modal logics. This new axiomatization and its completeness proof may sharpen our understanding of PAL and can be adapted to other dynamic epistemic logics. (shrink)

The task of axiomatizing physical theories has attracted, in recent years, some interest among both empirical scientists and logicians. However, the axiomatizations produced by either one of these two groups seldom appear satisfactory to the members of the other. It is the purpose of this paper to develop an approach that will satisfy the criteria of both, hence permit us to construct axiomatizations that will meet simultaneously the standards and needs of logicians and of empirical scientists.

1 Choice conjecture In axiomatizing nonclassical extensions of classical sentential logic one tries to make do, if one can, with adding to classical sentential logic a finite number of axiom schemes of the simplest kind and a finite number of inference rules of the simplest kind. The simplest kind of axiom scheme in effect states of a particular formula P that for any substitution of formulas for atoms the result of its application to P is to count as an axiom. (...) The simplest kind of onepremise inference rule in effect states of a particular pair of formulas P and Q that for any substitution of formulas for atoms, if the result of its application to P is a theorem, then the result of its application to Q is to count as a theorem; similarly for many-premise rules. Such are the schemes and rules of all the best-known modal and tense logics, for instance. Sometimes it is difficult to find such simple schemes and rules. In that case one may resort to less simple schemes or less simple rules. There is no generally recognized rigorous definition of "next simplest kind" of scheme. Neither is there any generally recognized definition of "next simplest kind" of rule, and hence there is no fully rigorous enunciation of the choice conjecture, the conjecture that schemes of the next simplest kind can always be avoided in favor of rules of the next simplest kind and vice versa. Nonetheless, there are cases where intuitively one does recognize that the schemes or rules in a given axiomatization are only slightly more complex than the simplest kind, including cases where one does have a choice between adopting slightly-more-complex-than-simplest schemes and adopting slightly-more-complex-than-simplest rules. In tense logic early examples of slightly more complex rules are found in [2] and [3] : there is one example of the embarrassed use of such rules in the former, and many examples of the enthusiastic use of such rules in the latter and its sequels. Accordingly the rules in question have come to be called "Gabbay-style" rules. (shrink)

A realistic axiomatic formulation of Galilean Quantum Field Theories is presented, from which the most important theorems of the theory can be deduced. In comparison with others formulations, the formal aspect has been improved by the use of certain mathematical theories, such as group theory and the theory of rigged Hilbert spaces. Our approach regards the fields as real things with symmetry properties. The general structure is analyzed and contrasted with relativistic theories.

Betweenness as a relation between three individual points has been widely studied in geometry and axiomatized by several authors in different contexts. The article proposes a more general notion of betweenness as a relation between three sets of points. The main technical result is a sound and complete logical system describing universal properties of this relation between sets of vertices of a graph.

In 1900 David Hilbert announced his famous list of then-opened mathematical problems; the problem number 6 in this list is axiomatization of physical theories. Since then a lot of systematic efforts have been invested into solving this problem. However the results of these efforts turned to be less successful than the early enthusiasts of axiomatic method expected. The existing axiomatizations of physical and biological theories provide a valuable logical analysis of these theories but they do not constitute anything like (...) their standard presentation,which can be used for transmission, evaluation, and justification of physical and biological knowledge. This state of theart in the axiomatization of physics is strong evidence that the standard notion of axiomatic theory stemming from Hilbert and Tarski is not appropriate for thet ask. However in the recent years in mathematics there emerged a new axiomatic approach best represented by the Homotopy Type theory (HoTT). We argue that the constructive axiomatic architecture used in HoTT has better chances to be successfully applied in physics as well as in computer science and engineering. (shrink)

Shortest possible axiomatizations for the implicational fragments of the modal logics S4 and S5 are reported. Among these axiomatizations is included a shortest single axiom for implicational S4—which to our knowledge is the first reported single axiom for that system—and several new shortest single axioms for implicational S5. A variety of automated reasoning strategies were essential to our discoveries.

Boolean connexive logic is an extension of Boolean logic that is closed under Modus Ponens and contains Aristotle’s and Boethius’ theses. According to these theses a sentence cannot imply its negation and the negation of a sentence cannot imply the sentence; and if the antecedent implies the consequent, then the antecedent cannot imply the negation of the consequent and if the antecedent implies the negation of the consequent, then the antecedent cannot imply the consequent. Such a logic was first introduced (...) by Jarmużek and Malinowski, by means of so-called relating semantics and tableau systems. Subsequently its modal extension was determined by means of the combination of possible-worlds semantics and relating semantics. In the following article we present axiomatic systems of some basic and modal Boolean connexive logics. Proofs of completeness will be carried out using canonical models defined with respect to maximal consistent sets. (shrink)

We provide a universal axiom system for plane hyperbolic geometry in a firstorder language with two sorts of individual variables, ‘points’ and ‘lines’ , containing three individual constants, A0, A1, A2, standing for three non-collinear points, two binary operation symbols, φ and ι, with φ = l to be interpreted as ‘[MATHEMATICAL SCRIPT SMALL L] is the line joining A and B’ , and ι = P to be interpreted as [MATHEMATICAL SCRIPT SMALL L]P is the point of intersection of (...) g and h , and two binary operation symbols, π1 and —2, with πi = g to be interpreted as ‘g is one of the two limiting paralle lines from P to [MATHEMATICAL SCRIPT SMALL L]. (shrink)

We consider the problem of finding, in the ambit of modal logic, a minimal characterization for finite Kripke frames, i.e., a formula which, given a frame, axiomatizes its theory employing the lowest possible number of variables and implies the other axiomatizations. We show that every finite transitive frame admits a minimal characterization over K4, and that this result can not be extended to K.

A realistic axiomatic formulation of nonrelativistic quantum mechanics for a single microsystem with spin is presented, from which the most important theorems of the theory can be deduced. In comparison with previous formulations, the formal aspect has been improved by the use of certain mathematical theories, such as the theory of equipped spaces, and group theory. The standard formalism is naturally obtained from the latter, starting from a central primitive concept: the Galilei group.

The present article employs a model-theoretic semantics to interpret a fragment of the language of the Quantified Argument Calculus (Quarc), a recently introduced logical system whose main aim is capturing the structure of natural language sentences in a closer way than does the language of classical logic. The main contribution is an axiomatization for the set of formulas that are valid in all standard interpretations within the employed semantics.

In this paper we provide quantifier-free, constructive axiomatizations for 2-dimensional absolute, Euclidean, and hyperbolic geometry. The main novelty consists in the first-order languages in which the axiom systems are formulated.

We present a faithful axiomatization of von Mises' notion of a random sequence, using an abstract independence relation. A byproduct is a quantifier elimination theorem for Friedman's "almost all" quantifier in terms of this independence relation.

Since belief revision deals with the interaction of belief and information over time, branching-time temporal logic seems a natural setting for a theory of belief change. We propose two extensions of a modal logic that, besides the next-time temporal operator, contains a belief operator and an information operator. The first logic is shown to provide an axiomatic characterization of the first six postulates of the AGM theory of belief revision, while the second, stronger, logic provides an axiomatic characterization of the (...) full set of AGM postulates. © 2006 Elsevier B.V. All rights reserved. (shrink)

It is known that even seemingly small fragments of the first-order temporal logic over the natural numbers are not recursively enumerable. In this paper we show that the monodic fragment is an exception by constructing its finite Hilbert-style axiomatization. We also show that the monodic fragment with equality is not recursively axiomatizable.

We axiomatize all quantifier properties which can be expressed by a universal condition on the class of algebras of sets.

We formulate a Hilbert-style axiomatic system and a tableau calculus for the STIT-based logic of imagination recently proposed in Wansing. Completeness of the axiom system is shown by the method of canonical models; completeness of the tableau system is also shown by using standard methods.

In a recent paper Berto introduces a semantic system for a logic of imagination, intended as positive conceivability, and aboutness of imaginative acts. This system crucially adopts elements of both the semantics of conditionals and the semantics of analytical implications in order to account for the central logical traits of the notion of truth in an act of imagination based on an explicit input. The main problem left unsolved is to put forward a complete set of axioms for the proposed (...) system. In the present paper I offer a solution to this problem by providing a complete axiomatization of a generalization of the original semantics. The difficulty in proving completeness lies in the fact that the modalities that capture the notion of truth in an act of imagination are neither standard nor minimal, so that the construction of the canonical model and the proof of the truth lemma are to be substantially modified. (shrink)

Minkowski geometry is axiomatized in terms of the asymmetric binary relation of optical connectibility, using ten first-order axioms and the second-order continuity axiom. An axiom system in terms of the symmetric binary optical connection relation is also presented. The present development is much simpler than the corresponding work of Robb, upon which it is modeled.

We treat a class of multi-person bargaining mechanisms based on games in coalitional form. For this class of games we identify properties of non-cooperative solution concepts, which are necessary and sufficient for the equilibrium outcomes to coincide with the core of the underlying coalitional form game. We view this result as a non-cooperative axiomatization of the core. In contrast to most of the literature on multi-person bargaining we avoid a precise specification of the rules of the game. Alternatively, we (...) impose properties of such games, which give rise to a large class of mechanisms, all of which are relevant for our axiomatization. (shrink)

Sound and complete axiomatizations are provided for a number of different logics involving modalities for the knowledge of multiple agents and operators for branching time, extending previous work of Halpern, van der Meyden and Vardi [to appear, SIAM Journal on Computing] for logics of knowledge and linear time. The paper considers the system constraints of synchrony, perfect recall and unique initial states, which give rise to interaction axioms. The language is based on the temporal logic CTL*, interpreted with respect to (...) a version of the bundle semantics. (shrink)

We investigate under what conditions a given set of collective judgments can arise from a specific voting procedure. In order to answer this question, we introduce a language similar to modal logic for reasoning about judgment aggregation procedures. In this language, the formula expresses that is collectively accepted, or that is a group judgment based on voting. Different judgment aggregation procedures may be underlying the group decision making. Here we investigate majority voting, where holds if a majority of individuals accepts, (...) consensus voting, where holds if all individuals accept, and dictatorship. We provide complete axiomatizations for judgment sets arising from all three aggregation procedures. (shrink)

This paper is a contribution to the question of how aspects of science have been perceived through history. In particular, I will discuss how the contribution of axiomatics to the development of science and mathematics was viewed in 20th century philosophy of science and philosophy of mathematics. It will turn out that in connection with scientific methodology, in particular regarding its use in the context of discovery, axiomatics has received only very little attention. This is a rather surprising result, since (...) axiomatizations have been employed extensively in mathematics, science, and also by the philosophers themselves. (shrink)

We give a Hilbert style axiomatization for the set of formulas in the temporal language with Until and Since which are valid over the real number flow of time. The axiomatization, which is orthodox in the sense of only having the usual temporal rules of inference, is complete with respect to single formulas.

In this work, we study Hilbert-style proof systems for logics based on the data-aware language CoreDataXPath(↓) where the comparison relation between nodes is not necessarily an equivalence relation. We give a sound and complete axiomatization of the class of tree-like Kripke frames endowed with a general comparison relation between nodes. Modular extensions of this axiomatization are also discussed, including cases where the comparison relation is reflexive, symmetric, transitive and an equivalence. A notable highlight that we recover an (...) class='Hi'>axiomatization for CoreDataXPath(↓) over any data-tree when the comparison is by ‘equal data’. Moreover, we prove that all these systems are decidable by leveraging the finite model property of their corresponding frame classes. (shrink)

In this paper we consider the modal logic with both $$\Box $$ and $$\Diamond $$ arising from Kripke models with a crisp accessibility and whose propositions are valued over the standard Gödel algebra $$[0,1]_G$$. We provide an axiomatic system extending the one from Caicedo and Rodriguez (J Logic Comput 25(1):37–55, 2015) for models with a valued accessibility with Dunn axiom from positive modal logics, and show it is strongly complete with respect to the intended semantics. The axiomatizations of the most (...) usual frame restrictions are given too. We also prove that in the studied logic it is not possible to get $$\Diamond $$ as an abbreviation of $$\Box $$, nor vice-versa, showing that indeed the axiomatic system we present does not coincide with any of the mono-modal fragments previously axiomatized in the literature. (shrink)

We study axiomatic extensions of the propositional constructive logic with strong negation having the disjunction property in terms of corresponding to them varieties of Nelson algebras. Any such varietyV is characterized by the property: (PQWC) ifA,B V, thenA×B is a homomorphic image of some well-connected algebra ofV.We prove:• each varietyV of Nelson algebras with PQWC lies in the fibre –1(W) for some varietyW of Heyting algebras having PQWC, • for any varietyW of Heyting algebras with PQWC the least and the (...) greatest varieties in –1(W) have PQWC, • there exist varietiesW of Heyting algebras having PQWC such that –1(W) contains infinitely many varieties (of Nelson algebras) with PQWC. (shrink)

Definitional and axiomatic theories of truth -- Objects of truth -- Tarski -- Truth and set theory -- Technical preliminaries -- Comparing axiomatic theories of truth -- Disquotation -- Classical compositional truth -- Hierarchies -- Typed and type-free theories of truth -- Reasons against typing -- Axioms and rules -- Axioms for type-free truth -- Classical symmetric truth -- Kripke-Feferman -- Axiomatizing Kripke's theory in partial logic -- Grounded truth -- Alternative evaluation schemata -- Disquotation -- Classical logic -- Deflationism (...) -- Reflection -- Ontological reduction -- Applying theories of truth. (shrink)

In this paper we discuss two approaches to the axiomatization of scientific theories in the context of the so called semantic approach, according to which (roughly) a theory can be seen as a class of models. The two approaches are associated respectively to Suppes’ and to da Costa and Chuaqui’s works. We argue that theories can be developed both in a way more akin to the usual mathematical practice (Suppes), in an informal set theoretical environment, writing the set theoretical (...) predicate in the language of set theory itself or, more rigorously (da Costa and Chuaqui), by employing formal languages that help us in writing the postulates to define a class of structures. Both approaches are called internal , for we work within a mathematical framework, here taken to be first-order ZFC. We contrast these approaches with an external one, here discussed briefly. We argue that each one has its strong and weak points, whose discussion is relevant for the philosophical foundations of science. (shrink)

Trees with indistinguishability relations provide a semantics for a temporal language “composed by” the Peircean tense operators and the Ockhamist modal operator. In this paper, a finite axiomatization with a non standard rule for this language interpreted over bundled trees with indistinguishability relations is given. This axiomatization is proved to be sound and strongly complete.

According to the analysis of concessive conditionals suggested by Crupi and Iacona, a concessive conditional $$p{{\,\mathrm{\hookrightarrow }\,}}q$$ p ↪ q is adequately formalized as a conjunction of conditionals. This paper presents a sound and complete axiomatic system for concessive conditionals so understood. The soundness and completeness proofs that will be provided rely on a method that has been employed by Raidl, Iacona, and Crupi to prove the soundness and completeness of an analogous system for evidential conditionals.

We give a sound and complete axiomatization for the full computation tree logic, CTL*, of R-generable models. This solves a long standing open problem in branching time temporal logic.

We give a brief introduction to the axiomatization of temporal logics. Branching continuations are shortly presented thereafter and the possibility of their clear syntactical axiomatization in a Hilbert-style system is investigated as last. Some basic preliminary observations and suggestions, how such axiomatization could start, are presented.

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)

This article develops an axiomatic theory of induction that speaks to the recent debate on Bayesian orgulity. It shows the exact principles associated with the belief that data can corroborate universal laws. We identify two types of disbelief about induction: skepticism that the existence of universal laws of nature can be determined empirically, and skepticism that the true law of nature, if it exists, can be successfully identified. We formalize and characterize these two dispositions toward induction by introducing novel axioms (...) for subjective probabilities. We also relate these dispositions to the axiom of σ-additivity. (shrink)