In the paper we examine the method of axiomatic rejection used to describe the set of nonvalid formulae of Aristotle's syllogistic. First we show that the condition which the system of syllogistic has to fulfil to be ompletely axiomatised, is identical to the condition for any first order theory to be used as a logic program. Than we study the connection between models used or refutation in a first order theory and rejected axioms for that theory. We show (...) that any formula of syllogistic enriched with classical connectives is decidable using models in the domain with three members. (shrink)

We prove that the intuitionistic sentential calculus is Ł-decidable, i.e. the sets of these of Int and of rejected formulas are disjoint and their union is equal to all formulas. A formula is rejected iff it is a sentential variable or is obtained from other formulas by means of three rejection rules. One of the rules is original, the remaining two are Łukasiewicz's rejection rules: by detachement and by substitution. We extensively use the method of Beth's semantic tableaux.

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)

The idea of rejection originated by Aristotle. The notion of rejection was introduced into formal logic by Łukasiewicz [20]. He applied it to complete syntactic characterization of deductive systems using an axiomatic method of rejection of propositions [22, 23]. The paper gives not only genesis, but also development and generalization of the notion of rejection. It also emphasizes the methodological approach to biaspectual axiomatic method of characterization of deductive systems as acceptance (asserted) systems and (...) rejection (refutation) systems, introduced by Łukasiewicz and developed by his student Słupecki, the pioneers of the method, which becomes relevant in modern approaches to logic. (shrink)

Following the finitist’s rejection of the complete totality of the natural numbers, a finitist language allows only propositional connectives and bounded quantifiers in the formula-construction but not unbounded quantifiers. This is opposed to the currently standard framework, a first-order language. We conduct axiomatic studies on the notion of truth in the framework of finitist arithmetic in which at least smash function $\#$ is available. We propose finitist variants of Tarski ramified truth theories up to rank $\omega $, of (...) Kripke–Feferman truth theory and of Friedman–Sheard truth theory, and show that all of these have the same strength as the finitist arithmetic of one higher level along Grzegorczyk hierarchy. On the other hand, we also show that adding Burgess-style groundedness schema, adjusted to the finitist setting, makes Kripke–Feferman truth theory as strong as primitive recursive arithmetic. Meanwhile, we obtain some basic results on finitist theories of (full and hat) inductive definitions and on the second order axiom of hat inductive definitions for positive operators. (shrink)

ABSTRACTLinguistic evidence supports the claim that certain, weak rejections are less specific than assertions. On the basis of this evidence, it has been argued that rejected sentences cannot be premisses and conclusions in inferences. We give examples of inferences with weakly rejected sentences as premisses and conclusions. We then propose a logic of weak rejection which accounts for the relevant phenomena and is motivated by principles of coherence in dialogue. We give a semantics for which this logic is sound (...) and complete, show that it axiomatizes the modal logic KD45 and prove that it still derives classical logic on its asserted fragment. Finally, we defend previous logics of strong rejection as being about the linguistically preferred interpretations of weak rejections. (shrink)

The standard axiomatization of quantum mechanics (QM) is not fully explicit about the role of the time-parameter. Especially, the time reference within the probability algorithm (the Born Rule, BR) is unclear. From a probability principle P1 and a second principle P2 affording a most natural way to make BR precise, a logical conflict with the standard expression for the completeness of QM can be derived. Rejecting P1 is implausible. Rejecting P2 leads to unphysical results and to a conflict with a (...) generalization of P2, a principle P3. All three principles are shown to be without alternative. It is thus shown that the standard expression of QM completeness must be revised. An absolutely explicit form of the axioms is provided, including a precise form of the projection postulate. An appropriate expression for QM completeness, reflecting the restrictions of the Gleason and Kochen-Specker theorems is proposed. (shrink)

The idea of rejection originated by Aristotle. The notion of rejection was introduced into formal logic by Łukasiewicz [20]. He applied it to complete syntactic characterization of deductive systems using an axiomatic method of rejection of propositions [22, 23]. The paper gives not only genesis, but also development and generalization of the notion of rejection. It also emphasizes the methodological approach to biaspectual axiomatic method of characterization of deductive systems as acceptance (asserted) systems and (...) rejection (refutation) systems, introduced by Łukasiewicz and developed by his student Słupecki, the pioneers of the method, which becomes relevant in modern approaches to logic. (shrink)

A rejection system, also referred to as a complementary calculus, is a proof system axiomatising the invalid formulas of a logic, in contrast to traditional calculi which axiomatise the valid ones. Rejection systems therefore introduce a purely syntactic way of determining non-validity without having to consider countermodels, which can be useful in procedures for automated deduction and proof search. Rejection calculi have first been formally introduced by Łukasiewicz in the context of Aristotelian syllogistic and subsequently rejection (...) systems for many well-known logics have been proposed. In this paper, we deal with rejection systems for so-called non-deterministic finite-valued logics, a special case of non-deterministic many-valued logics which were introduced by Avron and Lev as a generalisation of traditional many-valued logics. More specifically, we introduce a systematic method for constructing sequent-style rejection systems for any given non-deterministic finite-valued logic. Furthermore, as special instances of our method, we provide concrete calculi for specific paraconsistent logics which can be characterised in terms of non-deterministic two- and three-valued semantics, respectively. (shrink)

The standard Hilbert-style of axiomatic system yields the assertion of axioms and, via the use of rules, the assertion of theorems. However, there has been little work done on the corresponding axiomatic rejection of non-theorems. Such Hilbert-style rejection would be achieved by the inclusion of certain rejection-axioms (r-axioms) and, by use of rejection-rules (r-rules), the establishment of rejection-theorems (r-theorems). We will call such a proof a rejection-proof (r-proof). The ideal to aim for (...) would be for the theorems and r-theorems to bemutually exclusive and exhaustive. That is, if a formula A is a theorem then it is not an r-theorem, and if A is a non-theorem then it is an r-theorem. In this paper, I present a rejecion system for the first-degree formulae of a large number of relevant logics. (shrink)

This paper deals with Tarski's first axiomatic presentations of the syntax of deductive system. Andrzej Grzegorczyk's significant results which laid the foundations for the formalization of metalogic, are touched upon briefly. The results relate to Tarski's theory of concatenation, also called the theory of strings, and to Tarski's ideas on the formalization of metamathematics. There is a short mention of author's research in the field. The main part of the paper surveys research on the theory of deductive systems initiated (...) by Tarski, in particular research on the axiomatization of the general notion of consequence operation, axiom systems for the theories of classic consequence and for some equivalent theories, and axiom systems for the theories of nonclassic consequence. In this paper the results of Jerzy Supecki's research are taken into account, and also the author's and other people belonging to his circle of scientific research. Particular study is made of his dual characterization of deductive systems, both as systems in regard to acceptance and systems in regard to rejection . Comparison is made, therefore, with axiomatizations of the theories of rejection and dual consequence, and the theory of the usual consequence operation. (shrink)

A theorem due to Shoesmith and Smiley that axiomatizes two-valued multiple-conclusion logics is extended to partial logics.

In this paper, two axiomatic theories T− and T′ are constructed, which are dual to Tarski’s theory T+ (1930) of deductive systems based on classical propositional calculus. While in Tarski’s theory T+ the primitive notion is the classical consequence function (entailment) Cn+, in the dual theory T− it is replaced by the notion of Słupecki’s rejection consequence Cn− and in the dual theory T′ it is replaced by the notion of the family Incons of inconsistent sets. The author (...) has proved that the theories T+, T−, and T′ are equivalent. (shrink)

A calculus of names is a logical theory describing relations between names. By a pure calculus of names we mean a quantifier-free formulation of such a theory, based on classical propositional calculus. An axiomatisation of a pure calculus of names is presented and its completeness is discussed. It is shown that the axiomatisation is complete in three different ways: with respect to a set theoretical model, with respect to Leśniewski's Ontology and in a sense defined with the use of (...) class='Hi'>axiomatic rejection. The independence of axioms is proved. A decision procedure based on syntactic transformations and models defined in the domain of only two members is defined. (shrink)

Justification of theorems plays a vital role in any rational human activity. It is indispensable in science. The deductive method of justifying theorems is used in all sciences and it is the only method of justifying theorems in deductive disciplines. It is based on the notion of proof, thus it is a method of proving theorems. In the Warsaw School of Logic (WSL) – the famous branch of the Lvov-Warsaw School (LWS) – two types of the method: axiomatic deduction (...) method and natural deduction method were developed and practiced. In this paper, both of these methods are briefly discussed with an emphasis on their historical, groundbreaking significance for logic. The axiomatic method by means of rejection (proposed by Jan Łukasiewicz – a co-creator of the WSL), which is the method of the so-called rejection proof (rejection/refutation method) in logical systems and the proving method of generalized natural deduction, which is a hybrid deduction–refutation method of proving theorems, are also outlined in the paper. The author discusses their historical significance. This paper also contains a brief mention of the most significant results which the application of the discussed methods introduced into contemporary scientific research, not only logical one. (shrink)

This is the PhD dissertation, written under supervision of Professor Jerzy Słupecki, published in the book: U.Wybraniec-Skardowska i Grzegorz Bryll "Z badań nad teorią zdań odrzuconych" ( "Studies of theory of rejected sentences"), Zeszyty Naukowe Wyższej Szkoły Pedagogicznej w Opolu, Seria B: Studia i Monografie nr 22, pp. 5-131. It is the first, original publication on the theory of rejected sentences on which are based, among other, papers: "Theory of rejected propositions. I"and "Theory of rejected propositions II" with Jerzy Słupecki (...) and Grzegorz Bryll. -/- -/- . (shrink)

Aristotle in Analytica Posteriora presented a notion of proof as a special case of syllogism. In the present paper the remarks of Aristotle on the subject are used as an inspiration for developing formal systems of demonstrative syllogistic, which are supposed to formalize syllogisms that are proofs. We build our systems in the style of J. Łukasiewicz as theories based on classical propositional logic. The difference between our systems and systems of syllogistic known from the literature lays in the interpretation (...) of general positive sentences in which the same name occurs twice (of the form SaS). As a basic assumption of demonstrative syllogistic we accept a negation of such a sentence. We present three systems which differ in the interpretation of specific positive sentences in which the same name occurs twice (of the form SiS). The theories are defined as axiomatic systems. For all of them rejected axiomatizations are also supplied. For two of them a set theoretical model is also defined. (shrink)

In his article 'Rejection' (1996), Timothy Smiley had shown how a logical system allowing rules of rejection could provide a categorical axiomatization of the classical propositional calculus. This paper shows how rules of rejection, when placed in a multiple conclusion setting, can also provide categorical axiomatizations of a range of non-classical calculi which permit truth-value gaps, among them the calculus in Smiley's own 'Sense without denotation' (1960).

Logical and philosophical literature provides different classifications of reasoning. In the Polish literature on the subject, for instance, there are three popular ones accepted by representatives of the Lvov-Warsaw School: Jan Łukasiewicz, Tadeusz Czeżowski and Kazimierz Ajdukiewicz (Ajdukiewicz in Logika pragmatyczna [Pragmatic Logic]. PWN, Warsaw (1965, 2nd ed. 1974). Translated as: Pragmatic Logic. Reidel & PWN, Dordrecht, 1975). The author of this paper, having modified those classifications, distinguished the following types of reasoning: (1) deductive and (2) non-deductive, and additionally two (...) types of them in each of the two, depending on the manner of combining their premises with the conclusion through the relation of classical logical entailment. Consequently, the four types of reasoning: unilateral deductive (incl. its sub-types: deductive inference and proof), bilateral deductive (incl. complete induction), and reductive (incl. the sub-types: explanation and verification), logically nonvaluable (incl. inference by analogy, statistic inference), correspond to four operators of derivability. They are defined formally on the ground of Tarski’s axiomatic theory of deductive systems, by means of the consequence operation _Cn_ (Tarski in Monatshefte Math Phys 37:361–404, 1930a, C R Soc Sci Lett Vars 23:22–29, 1930b). Also, certain metalogical properties of these operators are given, as well as their relations with Tarski’s consequence operations \(Cn^+\) ( \(Cn^+ = Cn\) ) and dual consequences \(Cn^{-1}\) (Słupecki in Zeszyty Naukowe Uniwersytetu Wrocławskiego Seria B Nr 3:33–40, 1959, Słupecki et al. in Stud Log 29:76–123, 1971, Wybraniec-Skardowska, in: Wybraniec-Skardowska, Bryll (eds) Z badań nad teorią zdań odrzuconych [Studies in the Theory of Rejected Propositions], Series B, Studia i Monografie, Zeszyty Naukowe Wyższej Szkoły Pedagogicznej w Opolu, Opole, 1969), and \(Cn^-\) (Wójcicki in Bull Sect Log 2(2):54–57, 1973)). (shrink)

By pure calculus of names we mean a quantifier-free theory, based on the classical propositional calculus, which defines predicates known from Aristotle’s syllogistic and Leśniewski’s Ontology. For a large fragment of the theory decision procedures, defined by a combination of simple syntactic operations and models in two-membered domains, can be used. We compare the system which employs `ε’ as the only specific term with the system enriched with functors of Syllogistic. In the former, we do not need an empty name (...) in the model, so we are able to construct a 3-valued matrix, while for the latter, for which an empty name is necessary, the respective matrices are 4-valued. (shrink)

Axiomatic utility theory plays a foundational role in some accounts of normative principles. In this context, it is sometimes argued that transitivity of “better than” is a logical truth. Larry Temkin and Stuart Rachels use various examples to argue that “better than” is non–transitive, and that transitivity is not a logical truth. These examples typically involve some sort of “discontinuity.” In his discussion of one of these examples, John Broome suggests that we should reject the claim which involves “discontinuity.” (...) We can, I suggest, make sense of the examples which Temkin uses while sacrificing neither transitivity nor “discontinuity.” This response to Temkin's examples involves developing and modifying James Griffin's account of “discontinuity.” If the account of “discontinuity” seems implausible, that is because of a failure to allow for vagueness. A similar argument can be made in the context of the well-known “repugnant conclusion.” Footnotes1 This paper emerged from a discussion in one of John Broome's seminars. I am very grateful to John Broome, Erik Carlson, James Griffin, Wlodek Rabinowicz, Stuart Rachels, and Larry Temkin for allowing me to read various forthcoming manuscripts which are mentioned in the paper. I am also extremely grateful to Gustaf Arrhenius, Walter Bossert, Luc Bovens, John Broome, Richard Cookson, Robin Cubitt, James Griffin, Graham Loomes, Ben McQuillin, Shepley Orr, Wlodek Rabinowicz, Stuart Rachels, Bob Sugden, and two anonymous referees for comments on earlier versions. Any errors or omissions are mine. (shrink)

In the paper, the authors discuss two kinds of consequence operations characterized axiomatically. The first one are consequence operations of the type Cn + that, in the intuitive sense, are infallible operations, always leading from accepted (true) sentences of a deductive system to accepted (true) sentences of the deductive system (see Tarski in Monatshefte für Mathematik und Physik 37:361–404, 1930, Comptes Rendus des Séances De la Société des Sciences et des Lettres de Varsovie 23:22–29, 1930; Pogorzelski and Słupecki in Stud (...) Logic 9:163–176, 1960, Stud Logic 10:77–95, 1960). The second kind are dual consequence operations of the type Cn − that can be regarded as anti-infallible operations leading from non-accepted (rejected, false) sentences of a deductive system to non-accepted (rejected, false) sentences of the system (see Słupecki in Funkcja Łukasiewicza, 33–40, 1959; Wybraniec-Skardowska in Teoria zdań odrzuconych, 5–131, Zeszyty Naukowe Wyższej Szkoły Inżynierskiej w Opolu, Seria Matematyka 4(81):35–61, 1983, Ann Pure Appl Logic 127:243–266, 2004, in On the notion and function of rejected propositions, 179–202, 2005). The operations of the types Cn + and Cn − can be ordinary finitistic consequence operations or unit consequence operations. A deductive system can be characterized in two ways by the following triple: $$\begin{array}{ll}{\rm by\,the\,triple}:\hspace{1.4cm} (+ , -)\hspace{0,6cm} \\ {\rm or\,by\,the\,triple}:\hspace{1.0cm} (-, +)\hspace{0,6cm} .\end{array}$$ We compare axiom systems for operations of the types Cn + and Cn −, give some methodological properties of deductive systems defined by means of these operations (e.g. consistency, completeness, decidability in Łukasiewicz’s sense), as well as formulate different metatheorems concerning them. (shrink)

The monograph contains three works on research on the concept of a rejected sentence. This research, conducted under the supervision of Prof. Jerzy Słupecki by U. Wybraniec-Skardowska (1) "Theory of rejected sentences" and G. Bryll (2) "Some supplements of theory of rejected sentences" and (3) "Logical relations between sentences of empirical sciences" led to the construction of a theory rejected sentences and made it possible to formalize certain issues in the methodology of empirical sciences. The concept of a rejected sentence (...) was introduced by J. Łukasiewicz in the course of his inquiry into Aristotelian Syllogistic. It was essentialy generelized by J. Słupecki who, with reference to Tarski's axiomatic theory of deductive systems (1930), gave the formal definition of the rejection function Cn' according to which a sentence y is rejected on the base of a set of sentences X iff at least one sentence which belongs to X can be deduced from the sentence y. Słupecki proved (1959) that the function Cn', which assignes to the set X the set of sentences rejected on the basis of X, is additive and satisfies the axioms of Tarski's general theory of deductive systems. Work (1) uses not only Tarski's general theory of systems but also his the so-called enlarged theory of systems (1930). It constructs a theory T of rejected sentences (propositions), which is created from Tarski's richer theory of systems by adding one axiom and a number of definitions; among them the definition of the rejection function Cn' is fundamental one. Cn' is a function which assignes to every set X of false sentences the set Cn'X whose members are exclusively false senteces. A number of theorems which describes properties of defined concepts have been proved in T. Some of them are necessary for conducting considertions of the concluding section of (1) devoted to the empirical sentences. Section 2 of (1) deals with the theory of the unit consequenses. It is characterized by an axiom from which follow all axioms of Tarski's general theory of deductive systems, additivity and the property that the unit consequence of the set X of sentences is a unit consequence only one sentence of X. An example of unit consequence is the rejection consequence Cn'. In section 3 of (1) the dual theory T' equivalent to T is presented. In T' the primitive concept is the rejection function Cn'. The fundamental axiom of T' states that Cn' is a unit consequence. The concluding section brings a few examples of applications of the definitions and theorems of T in the domain of the scientific methodology. Work (2) corresonds to J. Słupecki paper (1959) and the theory T of rejected propositions given in work (1). In this paper some suplements of the theory T are given. Work (3) is an extension of the theory of rejected propositios given in the paper (1). It is an attempt of formalization some problems of methodology of the empirical sciences which concern to such concepts as: empirical sentence, similar sentence, generalization, inductive conclusion etc. (shrink)

Without introducing quantifiers, minimal axiomatic systems have already been constructed for Peirce's triadic logics. The present paper constructs a dual pair of axiomatic systems which can be used to introduce quantifiers into Peirce's preferred system of triadic logic. It is assumed (on the basis of textual evidence) that Peirce would prefer a system which rejects the absurd but tolerates the absolutely undecidable. The systems which are introduced are shown to be absolutely consistent, deductively complete, and minimal. These dual (...) axiomatic systems reveal an interesting elegance, independent of their historical motivation. (shrink)

It is axiomatic for most African scholars that the colonizers are responsible for the present problems facing the African continent. This is given much credence by Maduabuchi Dukor citing a barrage of issues which in summary pointed to the fact that the legacy of the colonizers to the African continent was ill willed to create chaos and therefore to make the African perpetually dependent on the colonizers. This paper accepts this fact but insists that the African as a human (...) being with free will and responsibility cannot continue to blame the colonizers when he has choice either to reject the colonial predetermined events or to accept them taking responsibility for his actions. (shrink)

Deflationists about truth hold that the function of the truth predicate is to enable us to make certain assertions we could not otherwise make. Pragmatists claim that the utility of negation lies in its role in registering incompatibility. The pragmatist insight about negation has been successfully incorporated into bilateral theories of content, which take the meaning of negation to be inferentially explained in terms of the speech act of rejection. We implement the deflationist insight in a bilateral theory by (...) taking the meaning of the truth predicate to be explained by its inferential relation to assertion. We combine this account of the meaning of the truth predicate with a new diagnosis of the Liar Paradox: its derivation requires the truth rules to preserve evidence, but these rules only preserve commitment. The result is a novel inferential deflationist theory of truth, which solves the Liar Paradox in a principled manner. We end by showing that our theory and simple extensions thereof have the resources to axiomatize the internal logic of several supervaluational hierarchies, including Cantini’s. This solves open problems of Halbach (2011) and Horsten (2011). (shrink)

The broader context for the formal darwinism project established by two of the commentators, in terms of reconciling the Modern Synthesis with Darwinian arguments over design and in terms of links to other types of selection and design, is discussed and welcomed. Some overselling of the project is admitted, in particular of whether it claims to consider all organic design. One important fundamental question raised in two commentaries is flagged but not answered of whether design is rightly represented by an (...) optimisation program, and another from one commentary of whether the coreplicon dissolves in the face of multi-generational imprinting. Calls for the project to be extended to design at levels above and below the individual are considered sympathetically, but judged impractical at the high level of abstraction of the project. All claims of substantive technical error are emphatically rejected. Close technical readings are welcomed that, among other things, represent the project as 'axiomatizing fitness'. The prospects for the project are set out in the light of this highly varied set of commentaries. (shrink)

This paper connects the following four topics: a class of generalized graphs whose relations do not have fixed arities called hypergraphs, a family of non-normal modal logics rejecting the aggregative axiom, an epistemic framework fighting logical omniscience, and the classical group knowledge modality of ‘someone knows’. Through neighborhood frames as their meeting point, we show that, among many completeness results obtained in this paper, the limit of a family of weakly aggregative logics is both exactly the modal logic of hypergraphs (...) and also the epistemic logic of local reasoning with veracity and positive introspection, and upon adding a single combinatorial axiom, it is also the logic of ‘someone knows’ for a fixed finite number of positively introspective agents. At the core of all these completeness results is a new canonical neighborhood model construction for monotone modal logics that is capable of dealing with all these diverse cases. We also provide an axiomatization for the logic of all non-n-colorable hypergraphs based on a filtration argument that also shows the decidability of the logics of hypergraphs we study. (shrink)

Aquinas, Ockham, and Burdan all claim that a person can be numerically identical over time, despite changes in size, shape, and color. How can we reconcile this with the Indiscernibility of Identicals, the principle that numerical identity implies indiscernibility across time? Almost all contemporary metaphysicians regard the Indiscernibility of Identicals as axiomatic. But I will argue that Aquinas, Ockham, and Burdan would reject it, perhaps in favor of a principle restricted to indiscernibility at a time.

Achinstein, Putnam, and others have urged the rejection of the received view on theories (which construes theories as axiomatic calculi where theoretical terms are given partial observational interpretations by correspondence rules) because (i) the notion of partial interpretation cannot be given precise formulation, and (ii) the observational-theoretical distinction cannot be drawn satisfactorily. I try to show that these are the wrong reasons for rejecting the received view since (i) is false and it is virtually impossible to demonstrate the (...) truth of (ii). Nonetheless, the received view should be rejected because it obscures a number of epistemologically important features of scientific theorizing. I show this by sketching an alternative analysis which reveals some of these features and gives a more faithful picture of scientific theorizing. (shrink)

This reissue of D. A. Gillies highly influential work, first published in 1973, is a philosophical theory of probability which seeks to develop von Mises’ views on the subject. In agreement with von Mises, the author regards probability theory as a mathematical science like mechanics or electrodynamics, and probability as an objective, measurable concept like force, mass or charge. On the other hand, Dr Gillies rejects von Mises’ definition of probability in terms of limiting frequency and claims that probability should (...) be taken as a primitive or undefined term in accordance with modern axiomatic approaches. This of course raises the problem of how the abstract calculus of probability should be connected with the ‘actual world of experiments’. It is suggested that this link should be established, not by a definition of probability, but by an application of Popper’s concept of falsifiability. In addition to formulating his own interesting theory, Dr Gillies gives a detailed criticism of the generally accepted Neyman Pearson theory of testing, as well as of alternative philosophical approaches to probability theory. The reissue will be of interest both to philosophers with no previous knowledge of probability theory and to mathematicians interested in the foundations of probability theory and statistics. (shrink)

I present a discussion of some issues in the ontology of spacetime. After a characterisation of the controversies among relationists, substantivalists, eternalists, and presentists, I offer a new argument for rejecting presentism, the doctrine that only present objects exist. Then, I outline and defend a form of spacetime realism that I call event substantivalism. I propose an ontological theory for the emergence of spacetime from more basic entities. Finally, I argue that a relational theory of pre-geometric entities can give rise (...) to substantival spacetime in such a way that relationism and substantivalism are not necessarily opposed positions, but rather complementary. In an appendix I give axiomatic formulations of my ontological views. (shrink)

Integrated information theory is a theory of consciousness that was originally formulated, and is standardly still expressed, in terms of controversial interpretations of its own ontological and epistemological basis. These form the orthodox interpretation of IIT. The orthodox epistemological interpretation is the axiomatic method, whereby IIT is ultimately derived from, justified by, and beholden to a set of phenomenological axioms. The orthodox ontological interpretation is panpsychism, according to which consciousness is fundamental, intrinsic, and pervasive. In this paper it is (...) argued that both components of the orthodox interpretation should be rejected. But IIT should not be rejected since an interpretation-neutral formulation is available. After explaining the neutral formulation, more plausible non-axiomatic epistemologies are defended. The neutral formulation is then shown to be consistent with various contemporary physicalist ontologies of consciousness, including the phenomenal concept strategy, representationalism, and even illusionism. Along the way, instructive connections between interpretations of IIT and interpretations of quantum mechanics are noted. (shrink)

The broader context for the formal darwinism project established by two of the commentators, in terms of reconciling the Modern Synthesis with Darwinian arguments over design and in terms of links to other types of selection and design, is discussed and welcomed. Some overselling of the project is admitted, in particular of whether it claims to consider all organic design. One important fundamental question raised in two commentaries is flagged but not answered of whether design is rightly represented by an (...) optimisation program, and another from one commentary of whether the coreplicon dissolves in the face of multi-generational imprinting. Calls for the project to be extended to design at levels above and below the individual are considered sympathetically, but judged impractical at the high level of abstraction of the project. All claims of substantive technical error are emphatically rejected. Close technical readings are welcomed that, among other things, represent the project as 'axiomatizing fitness'. The prospects for the project are set out in the light of this highly varied set of commentaries. (shrink)

The principle that each person is his own property occupies an almost axiomatic status in right-wing liberal thought as well as in some egalitarian theories. I reject any, full or partial, notion of property with respect to oneself by showing that any appeal and any justifiability which may be associated with self-ownership can at most serve to ground rights which are demonstrably non-property rights. As a contrast to self ownership, I introduce the non-proprietarian notion of Original Freedom. I compare (...) the two with respect to the control, income, and transfer aspects of ownership and suggest that Original Freedom is the more intuitively acceptable. (shrink)

Free logics is a family of first-order logics which came about as a result of examining the existence assumptions of classical logic. What those assumptions are varies, but the central ones are that the domain of interpretation is not empty, every name denotes exactly one object in the domain and the quantifiers have existential import. Free logics usually reject the claim that names need to denote in, and of the systems considered in this paper, the positive free logic concedes that (...) some atomic formulas containing non-denoting names are true, while negative free logic rejects even the latter claim. Inclusive logics, which reject, are likewise considered. These logics have complex and varied axiomatizations and semantics, and the goal of this paper is to present an orderly examination of the various systems and their mutual relations. This is done by first offering a formalization, using sequent calculi which possess all the desired structural properties of a good proof system, including admissibility of contraction and cut, while streamlining free logics in a way no other approach has. We then present a simple and unified system of abstract semantics, which allows for a straightforward demonstration of the meta-theoretical properties, and offers insights into the relationship between different logics. The final part of this paper is dedicated to extending the system with modalities by using a labeled sequent calculus, and here we are again able to map out the different approaches and their mutual relations using the same framework. (shrink)

Leibnizian-Newtonian calculus was a theory that dealt with geometrical objects; the figure continued to play one of the fundamental roles it had played in Greek geometry: it susbstituted a part of reasoning. During the eighteenth century a process of de-geometrization of calculus took place, which consisted in the rejection of the use of diagrams and in considering calculus as an 'intellectual' system where deduction was merely linguistic and mediated. This was achieved by interpreting variables as universal quantities and introducing (...) the notion of function, which replaced the study of curves. However, the emancipation of calculus from its basis in geometry was not comprehensive. In fact, the geometrical properties of curves were attributed de facto to functions and thus eighteenth-century calculus continued implicitly to use principles borrowed from geometry. There was therefore no transition to a purely syntactical theory based on axiomatically introduced terms, a shift which only took place subsequently in modern times. (shrink)

The present paper investigates why logical empiricists remained silent about one of the most philosophy-laden matters of theoretical physics of their day, the principle of least action (PLA). In the two decades around 1900, the PLA enjoyed a remarkable renaissance as a formal unification of mechanics, electrodynamics, thermodynamics, and relativity theory. Taking Ernst Mach's historico-critical stance, it could be liberated from much of its physico-theological dross. Variational calculus, the mathematical discipline on which the PLA was based, obtained a new rigorous (...) basis. These three developments prompted Max Planck to consider the PLA as formal embodiment of his convergent realist methodology. Typically rejecting ontological reductionism, David Hilbert took the PLA as the key concept in his axiomatizations of physical theories. It served one of the main goals of the axiomatic method: ''deepening the foundations.'' Although Moritz Schlick was a student of Planck's, and Hans Hahn and Philipp Frank enjoyed close ties to Gottingen, the PLA became a veritable Shibboleth to them. Rather than being worried by its historical connections with teleology and determinism, they erroneously identified Hilbert's axiomatic method tout court with Planck's metaphysical realism. Logical empiricists' strict containment policy against metaphysics required so strict a separation between physics and mathematics to exclude even those features of the PLA and the axiomatic method not tainted with metaphysics. (shrink)

A semantics is presented for Storrs McCall's separate axiomatizations of Aristotle's accepted and rejected polysyllogisms. The polysyllogisms under discussion are made up of either assertoric or apodeictic propositions. The semantics is given by associating a property with a pair of sets: one set consists of things having the property essentially and the other of things having it accidentally. A completeness proof and a semantic decision procedure are given.

Frege’s writings contain arguments for the thesis (i) that a thought expressed by a sentence S is a structured object whose composition pictures the composition of S, and for the thesis (ii) that a thought is an unstructured object. I will argue that Frege’s reasons for both (i) and (ii) are strong. Frege’s explanation of the difference in sense between logically equivalent sentences rests on assumption (i), while Frege’s claim that the same thought can be decomposed differently makes (ii) plausible. (...) Thoughts are supposed to do work that requires that they be structured and work that requires that they be unstructured. But this cannot be! While the standard response to this problem is to reject either (i) or (ii), I propose a charitable repair in the spirit of Frege’s theory that accepts both. The key idea can be found in Frege’s Basic Laws of Arithmetic(BL, GGA). Frege argues that the thought expressed by a sentence is determined by the truth-conditions that can be derived from the semantic axioms for the sentence constituents. The fact that the same axiomatic truth-condition can be derived in different ways from different semantic axioms suggests a Fregean solution of the dilemma: A thought is a type that is instantiated by all sequences of senses (decomposed thoughts) that have the same axiomatic truth-conditions. This allows for multiple decomposability of the same thought (for different decomposed thoughts can have the same axiomatic truth-conditions) and for a notion of containment (the decomposed thought contains those senses whose semantic axioms are needed in the derivation of the truth-conditions). My proposal combines the virtues of (i) and (ii) without inheriting their vices. (shrink)

A globally expressivist analysis of the indicative conditional based on the Ramsey Test is presented. The analysis is a form of ‘global’ expressivism in that it supplies acceptance and rejection conditions for all the sentence forming connectives of propositional logic (negation, disjunction, etc.) and so allows the conditional to embed in arbitrarily complex sentences (thus avoiding the Frege–Geach problem). The expressivist framework is semantically characterized in a restrictor semantics due to Vann McGee, and is completely axiomatized in a logic (...) dubbed ICL (‘Indicative Conditional Logic’). The expressivist framework extends the AGM (after Alchourron, Gärdenfors, Makinson) framework for belief revision and so provides a categorical (‘yes’–‘no’) epistemology for conditionals that complements McGee’s probabilistic framework while drawing on the same semantics. The result is an account of the semantics and acceptability conditions of the indicative conditional that fits well with the linguistic data (as pooled by linguists and from psychological experiments) while integrating both expressivist and semanticist perspectives. (shrink)

After a brief survey of the different meanings of consistency, the study is restricted to consistency understood as non-contradiction of sets of sentences. The philosophical reasons for this requirement are discussed, both in relation to the problem of sense and the problem of truth. The issue of mathematical truth is then addressed, and the different conceptions of it are put in relation with consistency. The formal treatment of consistency and truth in mathematical logic is then considered, with particular attention paid (...) to the relation between syntactic and semantic properties of sets and calculi. After the crisis of mathematical intuition and the dominance of the formalistic view, it seemed that consistency could totally replace the requirement of truth in mathematics, also in the sense that the existence of "objects" of axiomatic systems could be granted by their consistency. A rejection of this claim is presented, whose central point is a detailed analysis of the theorem that any consistent set S of sentences of first order logic has a model. A critical scrutiny shows that this model is very peculiar, being offered by the elements of the same language that is being interpreted, and the satisfiability conditions for any sentence being constituted by the mere fact of belonging to S. Though not being insignificant from a metatheoretical point of view, this theorem fails to endow consistency with an "ontological creativity", that is, with the capability of providing a model ontologically distinct from the language itself. A final discussion regarding the different "ontological regions" and the referential nature of truth clarifies the different aspects of the whole issue discussed. (shrink)

Conventionalism in sport philosophy has been rejected as unable to provide a theory of normativity and as collapsing in ethical relativism, but this criticism is rather imprecise about its target, which invites doubt about the legitimacy of the concept of conventionalism described by its critics. Instead, a more charitable and legitimate account of conventionalism is proposed, one that draws inspiration from conventionalism in axiomatic geometry and is able to avoid the counterarguments directed against conventionalism. This new model allows for (...) a number of non-conventional elements of sport, namely the definition of sport and certain central moral norms, while at the same time arguing that normativity in sport is not exhausted by them, which leaves athletic communities with authority over a broad range of norms. (shrink)

Summary The presentation will proceed as follows: (§ 3:) For the truth of an affirmative present‐tensed proposition Boethius required that its terms have actual referents, he would not accept any uninstantiated essence as a verifier. He also denied that any proposition about corruptible beings can be strictly necessary. He thus had a problem explaining how a theorem of one of the natural sciences differs from an ordinary contingent proposition. His rejection of uninstantiated essences also (§ 4) raised the question (...) how words can stay significant independently of the existence of referents, and more generally, to which degree language mirrors external reality. After a sketch of his solution to the semantic problems, § 5 returns to the question about scientific propositions. It is claimed that the core of Boethius' solution is a substitution of causal relationships for ordinary things (existents or essences) as an answer to the question what scientific knowledge is knowledge of and what scientific propositions are about. Since (§ 6) to Boethius axiomatized geometry provided the model for all sciences, consistency of a science's set of theorems should be important for him. A preoccupation with consistency can be seen in the rules he lays down for the dialogical game of “obligation” that was used as an academic exercise. An analysis (§ 7) of his description of another such game, the dialectical disputation, shows that he operated with a notion of truth‐within‐a‐game (requiring only conformity with the rules) as as opposed to absolute truth. § 8 claims that Boethius operated with a similar notion of truth‐within‐a‐science as opposed to absolute truth, and that his reason for so doing was the inaccessibility to human minds of the totality of causes. Doing science, then, (§ 9) is much like participating in a scholastic disputational game, and there may be scientifically‐true theorems conflicting with absolute truth known through revelation. § 10 epilogizes about Boethius' views about the highest good. (shrink)

The present note is intended to draw the reader's attention to the analysis of the relation between Newtonian Mechanics and Special Relativity Mechanics (henceforth to be referred to as NM and SRM), given by Philipp Frank, one of the classics of Logical Empiricism (in Frank [1938]). Frank's analysis of the relation between NM and SRM is interesting in many ways. Firstly, it shows clearly that problems of disruptive changes and of conceptual disparity were known to and discussed by Logical Empiricists (...) and that, therefore, some of them at least were not at all blinded to 'dynamic' problems of changes in actual science by their view of physical theories as interpreted axiomatic systems and did not deal with those theories as 'static, frozen in logical mold'. Secondly, it reveals some of the reasons for the Logical Empiricist rejection of what came to be known later as the incommensurability claim. (shrink)

Deflationists about truth hold that the function of the truth predicate is to enable us to make certain assertions we could not otherwise make. Pragmatists claim that the utility of negation lies in its role in registering incompatibility. The pragmatist insight about negation has been successfully incorporated into bilateral theories of content, which take the meaning of negation to be inferentially explained in terms of the speech act of rejection. We implement the deflationist insight in a bilateral theory by (...) taking the meaning of the truth predicate to be explained by its inferential relation to assertion. We combine this account of the meaning of the truth predicate with a new diagnosis of the liar paradox: its derivation requires the truth rules to preserve evidence, but these rules only preserve commitment. The result is a novel inferential deflationist theory of truth, which solves the liar paradox in a principled manner. We end by showing that our theory and simple extensions thereof have the resources to axiomatize the internal logic of several supervaluational hierarchies, including Cantini’s. This solves open problems of Halbach (2011) and Horsten (2011). (shrink)

We develop a logical system that captures two different interpretations of what extensive games model, and we apply this to a long-standing debate in game theory between those who defend the claim that common knowledge of rationality leads to backward induction or subgame perfect (Nash) equilibria and those who reject this claim. We show that a defense of the claim à la Aumann (1995) rests on a conception of extensive game playing as a one-shot event in combination with a principle (...) of rationality that is incompatible with it, while a rejection of the claim à la Reny (1988) assumes a temporally extended, many-moment interpretation of extensive games in combination with implausible belief revision policies. In addition, the logical system provides an original inductive and implicit axiomatization of rationality in extensive games based on relations of dominance rather than the usual direct axiomatization of rationality as maximization of expected utility. (shrink)

Reasoning and change over inconsistent knowledge bases is of utmost relevance in areas like medicine and law. Argumentation may bring the possibility to cope with both problems. Firstly, by constructing an argumentation framework from the inconsistent KB, we can decide whether to accept or reject a certain claim through the interplay among arguments and counterarguments. Secondly, by handling dynamics of arguments of the AF, we might deal with the dynamics of knowledge of the underlying inconsistent KB. Dynamics of arguments has (...) recently attracted attention and although some approaches have been proposed, a full axiomatization within the theory of belief revision was still missing. A revision arises when we want the argumentation semantics to accept an argument. Argument Theory Change encloses the revision operators that modify the AF by analyzing dialectical trees—arguments as nodes and attacks as edges—as the adopted argumentation semantics. In this article, we present a simple approach to ATC based on propositional KBs. This allows to manage change of inconsistent KBs by relying upon classical belief revision, although contrary to it, consistency restoration of the KB is avoided. Subsequently, a set of rationality postulates adapted to argumentation is given, and finally, the proposed model of change is related to the postulates through the corresponding representation theorem. Though we focus on propositional logic, the results can be easily extended to more expressive formalisms such as first-order logic and description logics, to handle evolution of ontologies. (shrink)