The systems of arithmetic discussed in this work are non-elementary theories. In this paper, natural numbers are characterized axiomatically in two di erent ways. We begin by recalling the classical set P of axioms of Peano’s arithmetic of natural numbers proposed in 1889 (including such primitive notions as: set of natural numbers, zero, successor of natural number) and compare it with the set W of axioms of this arithmetic (including the primitive notions like: set of natural numbers and relation of (...) inequality) proposed by Witold Wilkosz, a Polish logician, philosopher and mathematician, in 1932. The axioms W are those of ordered sets without largest element, in which every non-empty set has a least element, and every set bounded from above has a greatest element. We show that P and W are equivalent and also that the systems of arithmetic based on W or on P, are categorical and consistent. There follows a set of intuitive axioms PI of integers arithmetic, modelled on P and proposed by B. Iwanuś, as well as a set of axioms WI of this arithmetic, modelled on the W axioms, PI and WI being also equivalent, categorical and consistent. We also discuss the problem of independence of sets of axioms, which were dealt with earlier. (shrink)

We give a complete axiomatization of the identities of the basic game algebra valid with respect to the abstract game board semantics. We also show that the additional conditions of termination and determinacy of game boards do not introduce new valid identities.En route we introduce a simple translation of game terms into plain modal logic and thus translate, while preserving validity both ways, game identities into modal formulae.The completeness proof is based on reduction of game terms to a certain ‘minimal (...) canonical form’, by using only the axiomatic identities, and on showing that the equivalence of two minimal canonical terms can be established from these identities. (shrink)

Potentialists think that the concept of set is importantly modal. Using tensed language as an heuristic, the following bar-bones story introduces the idea of a potential hierarchy of sets: 'Always: for any sets that existed, there is a set whose members are exactly those sets; there are no other sets.' Surprisingly, this story already guarantees well-foundedness and persistence. Moreover, if we assume that time is linear, the ensuing modal set theory is almost definitionally equivalent with non-modal set theories; specifically, (...) with Level Theory, as developed in Part 1. (shrink)

(...) However, whether we chose a weak or strong approximation, the set would not make any sense at all, if (once more) this choice would not be justified in either temporal or spatial sense or given the context of possible applicability of the set in different circumstances. This would obviously represent a dualism in itself as we would (for instance) posit and apply a full identity-equality-equivalence of x and y when applying Newtonian physics to certain observations we make (it would (...) be the case of neural correlates), and we would posit and apply a non - identity-equality-equivalence of x and y when applying Quantum mechanics to other observations. Following this dualism in and of theories, the same sate would need to be slightly modified: U2:(x~y)∪(x≈y); U3:(x~y)∩(x≈y); U4a:(x~y)⊆(x≈y) vs. U4b:(x~y)⊇(x≈y). (shrink)

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)

We investigate an enrichment of the propositional modal language L with a "universal" modality ■ having semantics x ⊧ ■φ iff ∀y(y ⊧ φ), and a countable set of "names" - a special kind of propositional variables ranging over singleton sets of worlds. The obtained language ℒ $_{c}$ proves to have a great expressive power. It is equivalent with respect to modal definability to another enrichment ℒ(⍯) of ℒ, where ⍯ is an additional modality with the semantics x ⊧ (...) ⍯φ iff Vy(y ≠ x → y ⊧ φ). Model-theoretic characterizations of modal definability in these languages are obtained. Further we consider deductive systems in ℒ $_{c}$ . Strong completeness of the normal ℒ $_{c}$ logics is proved with respect to models in which all worlds are named. Every ℒ $_{c}$ -logic axiomatized by formulae containing only names (but not propositional variables) is proved to be strongly frame-complete. Problems concerning transfer of properties ([in]completeness, filtration, finite model property etc.) from ℒ to ℒ $_{c}$ are discussed. Finally, further perspectives for names in multimodal environment are briefly sketched. (shrink)

We introduce and study hierarchies of extensions of the propositional modal and temporal languages with pairs of new syntactic devices: point of reference-reference pointer which enable semantic references to be made within a formula. We propose three different but equivalent semantics for the extended languages, discuss and compare their expressiveness. The languages with reference pointers are shown to have great expressive power (especially when their frugal syntax is taken into account), perspicuous semantics, and simple deductive systems. For instance, Kamp's (...) and Stavi's temporal operators, as well as nominals (names, clock variables), are definable in them. Universal validity in these languages is proved undecidable. The basic modal and temporal logics with reference pointers are uniformly axiomatized and a strong completeness theorem is proved for them and extended to some classes of their extensions. (shrink)

For each positive n , two alternative axiomatizations of the theory of strings over n alphabetic characters are presented. One class of axiomatizations derives from Tarski's system of the Wahrheitsbegriff and uses the n characters and concatenation as primitives. The other class involves using n character-prefixing operators as primitives and derives from Hermes' Semiotik. All underlying logics are second order. It is shown that, for each n, the two theories are definitionally equivalent [or synonymous in the sense (...) of deBouvere]. It is further shown that each member of one class is synonymous with each member of the other class; thus that all of the theories are definitionally equivalent with each other and with Peano arithmetic. Categoricity of Peano arithmetic then implies categoricity of each of the above theories. (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)

_Framing effects_ concern the having of different attitudes towards logically or necessarily equivalent contents. Framing is of crucial importance for cognitive science, behavioral economics, decision theory, and the social sciences at large. We model a typical kind of framing, grounded in (i) the structural distinction between beliefs activated in working memory and beliefs left inactive in long term memory, and (ii) the topic- or subject matter-sensitivity of belief: a feature of propositional attitudes which is attracting growing research attention. We (...) introduce a class of models featuring (i) and (ii) to represent, and reason about, agents whose belief states can be subject to framing effects. We axiomatize a logic which we prove to be sound and complete with respect to the class. (shrink)

In classically based modal logic, there are three common conceptions of necessity, the universal conception, the equivalence relation conception, and the axiomatic conception. They provide distinct presentations of the modal logic S5, all of which coincide in the basic modal language. We explore these different conceptions in the context of the relevant logic R, demonstrating where they come apart. This reveals that there are many options for being an S5-ish extension of R. It further reveals a divide between the universal (...) conception of necessity on the one hand, and the axiomatic conception on the other: The latter is consistent with motivations for relevant logics while the former is not. For the committed relevant logician, necessity cannot be the truth in all possible worlds. (shrink)

This paper introduces new logical systems which axiomatize a formal representation of inconsistency (here taken to be equivalent to contradictoriness) in classical logic. We start from an intuitive semantical account of inconsistent data, fixing some basic requirements, and provide two distinct sound and complete axiomatics for such semantics, LFI1 and LFI2, as well as their first-order extensions, LFI1* and LFI2*, depending on which additional requirements are considered. These formal systems are examples of what we dub Logics of Formal Inconsistency (...) (LFI) and form part of a much larger family of similar logics. We also show that there are translations from classical and paraconsistent first-order logics into LFI1* and LFI2*, and back. Hence, despite their status as subsystems of classical logic, LFI1* and LFI2* can codify any classical or paraconsistent reasoning. (shrink)

The Sure-Thing Principle famously appears in Savage’s axiomatization of Subjective Expected Utility. Yet Savage introduces it only as an informal, overarching dominance condition motivating his separability postulate P2 and his state-independence postulate P3. Once these axioms are introduced, by and large, he does not discuss the principle any more. In this note, we pick up the analysis of the Sure-Thing Principle where Savage left it. In particular, we show that each of P2 and P3 is equivalent to a dominance (...) condition; that they strengthen in different directions a common, basic dominance axiom; and that they can be explicitly combined in a unified dominance condition that is a candidate formal statement for the Sure-Thing Principle. Based on elementary proofs, our results shed light on some of the most fundamental properties of rational choice under uncertainty. In particular they imply, as corollaries, potential simplifications for Savage’s and the Anscombe- Aumann axiomatizations of Subjective Expected Utility. Most surprisingly perhaps, they reveal that in Savage’s axiomatization, P3 can be weakened to a natural strengthening of so-called Obvious Dominance. (shrink)

Bilattices, introduced by Ginsberg as a uniform framework for inference in artificial intelligence, are algebraic structures that proved useful in many fields. In recent years, Arieli and Avron developed a logical system based on a class of bilattice-based matrices, called logical bilattices, and provided a Gentzen-style calculus for it. This logic is essentially an expansion of the well-known Belnap–Dunn four-valued logic to the standard language of bilattices. Our aim is to study Arieli and Avron’s logic from the perspective of abstract (...) algebraic logic . We introduce a Hilbert-style axiomatization in order to investigate the properties of the algebraic models of this logic, proving that every formula can be reduced to an equivalent normal form and that our axiomatization is complete w.r.t. Arieli and Avron’s semantics. In this way, we are able to classify this logic according to the criteria of AAL. We show, for instance, that it is non-protoalgebraic and non-self-extensional. We also characterize its Tarski congruence and the class of algebraic reducts of its reduced generalized models, which in the general theory of AAL is usually taken to be the algebraic counterpart of a sentential logic. This class turns out to be the variety generated by the smallest non-trivial bilattice, which is strictly contained in the class of algebraic reducts of logical bilattices. On the other hand, we prove that the class of algebraic reducts of reduced models of our logic is strictly included in the class of algebraic reducts of its reduced generalized models. Another interesting result obtained is that, as happens with some implicationless fragments of well-known logics, we can associate with our logic a Gentzen calculus which is algebraizable in the sense of Rebagliato and Verdú . We also prove some purely algebraic results concerning bilattices, for instance that the variety of distributive bilattices is generated by the smallest non-trivial bilattice. This result is based on an improvement of a theorem by Avron stating that every bounded interlaced bilattice is isomorphic to a certain product of two bounded lattices. We generalize it to the case of unbounded interlaced bilattices. (shrink)

The logics of formal inconsistency (LFIs, for short) are paraconsistent logics (that is, logics containing contradictory but non-trivial theories) having a consistency connective which allows to recover the ex falso quodlibet principle in a controlled way. The aim of this paper is considering a novel semantical approach to first-order LFIs based on Tarskian structures defined over swap structures, a special class of multialgebras. The proposed semantical framework generalizes previous aproaches to quantified LFIs presented in the literature. The case of QmbC, (...) the simpler quantified LFI expanding classical logic, will be analyzed in detail. An axiomatic extension of QmbC called QLFI1o is also studied, which is equivalent to the quantified version of da Costa and D'Ottaviano 3-valued logic J3. The semantical structures for this logic turn out to be Tarkian structures based on twist structures. The expansion of QmbC and QLFI1o with a standard equality predicate is also considered. (shrink)

This paper attempts to address the question what logical strength theories of truth have by considering such questions as: If you take a theory T and add a theory of truth to it, how strong is the resulting theory, as compared to T? Once the question has been properly formulated, the answer turns out to be about as elegant as one could want: Adding a theory of truth to a finitely axiomatized theory T is more or less equivalent to (...) a kind of abstract consistency statement. A large part of the interest of the paper lies in the way syntactic theories are 'disentangled' from object theories. (shrink)

The present first part about the eventual completeness of mathematics (called “Hilbert mathematics”) is concentrated on the Gödel incompleteness (1931) statement: if it is an axiom rather than a theorem inferable from the axioms of (Peano) arithmetic, (ZFC) set theory, and propositional logic, this would pioneer the pathway to Hilbert mathematics. One of the main arguments that it is an axiom consists in the direct contradiction of the axiom of induction in arithmetic and the axiom of infinity in set theory. (...) Thus, the pair of arithmetic and set are to be similar to Euclidean and non-Euclidean geometries distinguishably only by the Fifth postulate now, i.e. after replacing it and its negation correspondingly by the axiom of finiteness (induction) versus that of finiteness being idempotent negations to each other. Indeed, the axiom of choice, as far as it is equivalent to the well-ordering “theorem”, transforms any set in a well-ordering either necessarily finite according to the axiom of induction or also optionally infinite according to the axiom of infinity. So, the Gödel incompleteness statement relies on the logical contradiction of the axiom of induction and the axiom of infinity in the final analysis. Nonetheless, both can be considered as two idempotent versions of the same axiom (analogically to the Fifth postulate) and then unified after logicism and its inherent intensionality since the opposition of finiteness and infinity can be only extensional (i.e., relevant to the elements of any set rather than to the set by itself or its characteristic property being a proposition). So, the pathway for interpreting the Gödel incompleteness statement as an axiom and the originating from that assumption for “Hilbert mathematics” accepting its negation is pioneered. A much wider context relevant to realizing the Gödel incompleteness statement as a metamathematical axiom is consistently built step by step. The horizon of Hilbert mathematics is the proper subject in the third part of the paper, and a reinterpretation of Gödel’s papers (1930; 1931) as an apology of logicism as the only consistent foundations of mathematics is the topic of the next second part. (shrink)

One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results (...) hold for several systems of the hierarchy of paraconsistent logics known as Logics of Formal Inconsistency (LFIs). Because of this, these logics are uniquely characterized by semantics of non-deterministic kind. This paper offers a solution for two open problems in the domain of paraconsistency, in particular connected to algebraization of LFIs, by obtaining several LFIs weaker than C1, each of one is algebraizable in the standard Lindenbaum-Tarski's sense by a suitable variety of Boolean algebras extended with operators. This means that such LFIs satisfy the replacement property. The weakest LFI satisfying replacement presented here is called RmbC, which is obtained from the basic LFI called mbC. Some axiomatic extensions of RmbC are also studied, and in addition a neighborhood semantics is defined for such systems. It is shown that RmbC can be defined within the minimal bimodal non-normal logic E+E defined by the fusion of the non-normal modal logic E with itself. Finally, the framework is extended to first-order languages. RQmbC, the quantified extension of RmbC, is shown to be sound and complete w.r.t. BALFI semantics. (shrink)

Sentences containing definite descriptions, expressions of the form ‘The F’, can be formalised using a binary quantifier ι that forms a formula out of two predicates, where ιx[F, G] is read as ‘The F is G’. This is an innovation over the usual formalisation of definite descriptions with a term forming operator. The present paper compares the two approaches. After a brief overview of the system INFι of intuitionist negative free logic extended by such a quantifier, which was presented in (...) (Kürbis 2019), INFι is first compared to a system of Tennant’s and an axiomatic treatment of a term forming ι operator within intuitionist negative free logic. Both systems are shown to be equivalent to the subsystem of INFι in which the G of ιx[F, G] is restricted to identity. INFι is then compared to an intuitionist version of a system of Lambert’s which in addition to the term forming operator has an operator for predicate abstraction for indicating scope distinctions. The two systems will be shown to be equivalent through a translation between their respective languages. Advantages of the present approach over the alternatives are indicated in the discussion. (shrink)

The paper discusses the origin of dark matter and dark energy from the concepts of time and the totality in the final analysis. Though both seem to be rather philosophical, nonetheless they are postulated axiomatically and interpreted physically, and the corresponding philosophical transcendentalism serves heuristically. The exposition of the article means to outline the “forest for the trees”, however, in an absolutely rigorous mathematical way, which to be explicated in detail in a future paper. The “two deductions” are two successive (...) stage of a single conclusion mentioned above. The concept of “transcendental invariance” meaning ontologically and physically interpreting the mathematical equivalence of the axiom of choice and the well-ordering “theorem” is utilized again. Then, time arrow is a corollary from that transcendental invariance, and in turn, it implies quantum information conservation as the Noether correlate of the linear “increase of time” after time arrow. Quantum information conservation implies a few fundamental corollaries such as the “conservation of energy conservation” in quantum mechanics from reasons quite different from those in classical mechanics and physics as well as the “absence of hidden variables” (versus Einstein’s conjecture) in it. However, the paper is concentrated only into the inference of another corollary from quantum information conservation, namely, dark matter and dark energy being due to entanglement, and thus and in the final analysis, to the conservation of quantum information, however observed experimentally only on the “cognitive screen” of “Mach’s principle” in Einstein’s general relativity. therefore excluding any other source of gravitational field than mass and gravity. Then, if quantum information by itself would generate a certain nonzero gravitational field, it will be depicted on the same screen as certain masses and energies distributed in space-time, and most presumably, observable as those dark energy and dark matter predominating in the universe as about 96% of its energy and matter quite unexpectedly for physics and the scientific worldview nowadays. Besides on the cognitive screen of general relativity, entanglement is available necessarily on still one “cognitive screen” (namely, that of quantum mechanics), being furthermore “flat”. Most probably, that projection is confinement, a mysterious and ad hoc added interaction along with the fundamental tree ones of the Standard model being even inconsistent to them conceptually, as far as it need differ the local space from the global space being definable only as a relation between them (similar to entanglement). So, entanglement is able to link the gravity of general relativity to the confinement of the Standard model as its projections of the “cognitive screens” of those two fundamental physical theories. (shrink)

The aim of the paper is to analyze the expressive power of the square operator of Łukasiewicz logic: ∗x=x⊙x⁠, where ⊙ is the strong Łukasiewicz conjunction. In particular, we aim at understanding and characterizing those cases in which the square operator is enough to construct a finite MV-chain from a finite totally ordered set endowed with an involutive negation. The first of our main results shows that, indeed, the whole structure of MV-chain can be reconstructed from the involution and the (...) Łukasiewicz square operator if and only if the obtained structure has only trivial subalgebras and, equivalently, if and only if the cardinality of the starting chain is of the form n+1 where n belongs to a class of prime numbers that we fully characterize. Secondly, we axiomatize the algebraizable matrix logic whose semantics is given by the variety generated by a finite totally ordered set endowed with an involutive negation and Łukasiewicz square operator. Finally, we propose an alternative way to account for Łukasiewicz square operator on involutive Gödel chains. In this setting, we show that such an operator can be captured by a rather intuitive set of equations. (shrink)

The paper is an attempt at a logical explication of some crucial notions of current general semantics and pragmatics. A general, axiomatic, formal-logical theory of meaning and interpretation is outlined in this paper.In the theory, accordingto the token-type distinction of Peirce, language is formalised on two levels: first as a language of token-objects (understood as material, empirical, enduring through time-and space objects) and then – as a language of type-objects (understood as abstract objects, as classes of tokens). The basic concepts (...) of the theory, i.e. the notions: meaning, denotation and interpretation of well-formed expressions (wfes) of the language are formalised on the type-level, by utilising some semantic-pragmatic primitive notions introduced on the token-level. The paper is divided into two parts.In Part Ia theoryof meaningand denotation is proposed, and in Part II - its expansion to the theory of meaning and interpretation is presented.The meaninga wfe is defined as an equivalence class of the relation possessing the same manner of using types (cf. Ajdukiewicz [1934], Wittgenstein [1953]). The concept of denotation is defined by means of the relation of referring which holds between wfe-types and objects of reality described by the given language. (shrink)

It is shown that a complete axiomatization of classical non-tautologies can be obtained by taking F (falsehood) as the sole axiom along with the two inference rules: (i) if A is a substitution instance of B, then A |– B; and (ii) if A is obtained from B by replacement of equivalent sentences, then A |– B (counting as equivalent the pairs {T, ~F}, {F, F&F}, {F, F&T}, {F, T&F}, {T, T&T}). Since the set of tautologies is also (...) specifiable by purely syntactic means, the resulting picture gives an improved syntactic account of classical sentential logic. The picture can then be completed by considering related systems that prove adequate to specify the set of contradictions, the set of non-contradictions, and the set of contingencies respectively. (shrink)

In terms of validity in Kripke frames, a modal formula expresses a universal monadic second-order condition. Those modal formulae which are equivalent to first-order conditions are called elementary. Modal formulae which have a certain persistence property which implies their validity in all canonical frames of modal logics axiomatized with them, and therefore their completeness, are called canonical. This is a survey of a recent and ongoing study of the class of elementary and canonical modal formulae. We summarize main ideas (...) and results, and outline further research perspectives. (shrink)

ABSTRACT: This 1974 paper builds on our 1969 paper (Corcoran-Weaver [2]). Here we present three (modal, sentential) logics which may be thought of as partial systematizations of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of these three logics coincide with one another and with those of standard formalizations of Lewis's S5. These logics, when regarded as logistic systems (cf. Corcoran [1], p. 154), are seen to be (...) class='Hi'>equivalent; but, when regarded as consequence systems (ibid., p. 157), one diverges from the others in a fashion which suggests that two standard measures of semantic complexity may not be as closely linked as previously thought. -/- This 1974 paper uses the linear notation for natural deduction presented in [2]: each two-dimensional deduction is represented by a unique one-dimensional string of characters. Thus obviating need for two-dimensional trees, tableaux, lists, and the like—thereby facilitating electronic communication of natural deductions. The 1969 paper presents a (modal, sentential) logic which may be thought of as a partial systematization of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of this logic coincides those of standard formalizations of Lewis’s S4. Among the paper's innovations is its treatment of modal logic in the setting of natural deduction systems--as opposed to axiomatic systems. The author’s apologize for the now obsolete terminology. For example, these papers speak of “a proof of a sentence from a set of premises” where today “a deduction of a sentence from a set of premises” would be preferable. 1. Corcoran, John. 1969. Three Logical Theories, Philosophy of Science 36, 153–77. J P R -/- 2. Corcoran, John and George Weaver. 1969. Logical Consequence in Modal Logic: Natural Deduction in S5 Notre Dame Journal of Formal Logic 10, 370–84. MR0249278 (40 #2524). 3. Weaver, George and John Corcoran. 1974. Logical Consequence in Modal Logic: Some Semantic Systems for S4, Notre Dame Journal of Formal Logic 15, 370–78. MR0351765 (50 #4253). (shrink)

This paper focuses on order-preserving logics defined from varieties of distributive lattices with negation, and in particular on the problem of whether these can be axiomatized by means Hilbert-style calculi that are finite. On the negative side, we provide a syntactic condition on the equational presentation of a variety that entails failure of finite axiomatizability for the corresponding logic. An application of this result is that the logic of all distributive lattices with negation is not finitely axiomatizable; we likewise establish (...) that the order-preserving logic of the variety of all Ockham algebras is also not finitely axiomatizable. On the positive side, we show that an arbitrary subvariety of semi-De Morgan algebras is axiomatized by a finite number of equations if and only if the corresponding order-preserving logic is axiomatized by a finite Hilbert-style calculus. This equivalence also holds for every subvariety of a Berman variety of Ockham algebras. We obtain, as a corollary, a new proof that the implication-free fragment of intuitionistic logic is finitely axiomatizable, as well as a new corresponding Hilbert-style calculus. Our proofs are constructive in that they allow us to effectively convert an equational presentation of a variety of algebras into a Hilbert-style calculus for the corresponding order-preserving logic, and vice versa. We also consider the assertional logics associated to the above-mentioned varieties, showing in particular that the assertional logics of finitely axiomatizable subvarieties of semi-De Morgan algebras are finitely axiomatizable as well. (shrink)

The two-fold ontological character of linguistic objects revealed due to the distinction between “type” and “token” introduced by Ch. S. Peirce can be a base of the two-fold, both theoretical and axiomatic, approach to the language. Referring to some ideas included in A. A. Markov’s work [1954] (in Russian) on Theory of Algorithms and in some earlier papers of the author, the problem of formalization of the concrete and abstract words theories raised by J. Słupecki was solved. The construction of (...) the theories presented here has two levels. The axiomatic theory of label-tokens: material, physical linguistic objects, constitutes the first one. Label-types, according to the literature of the subject, are defined on the other level as equivalence classes of equiform label-tokens. Assuming the opposite point of view, one can accept that theory of label-types: abstract labels, formalized on the first level, in which it is possible to define the notion of label-token as well as the derivative notions on the second level, should become the basis of formalization of the theory of linguistic expressions and the theory of language in general. The axioms and definitions of both theories of labels: T k and T p representing the other approach to the ontology of language are included in the sequel of the abstract. The foundations of the theory of labels T k in which the primary assumption as to the label-types existence is superfluous have been referred on the basis of the author's monography "Teorie Języków Syntaktycznie Kategorialnych" ( "The Theories of Syntactically Categorial Languages"), PWN, Warszawa-Wrocław 1985. The basis of the theory of labels T p which takes into account the other position has to be presented here for the first time. Some extended ideas of the paper will also be presented in author's paper "Logiczne podstawy ontologii składni Języka" ("Logical foundations of language syntax ontology), Studia Filozoficzne 6-7 (271-272), (1988), pp. 263-284. (shrink)

According to Cantor (Mathematische Annalen 21:545–586, 1883 ; Cantor’s letter to Dedekind, 1899 ) a set is any multitude which can be thought of as one (“jedes Viele, welches sich als Eines denken läßt”) without contradiction—a consistent multitude. Other multitudes are inconsistent or paradoxical. Set theoretical paradoxes have common root—lack of understanding why some multitudes are not sets. Why some multitudes of objects of thought cannot themselves be objects of thought? Moreover, it is a logical truth that such multitudes do (...) exist. However we do not understand this logical truth so well as we understand, for example, the logical truth $${\forall x \, x = x}$$ . In this paper we formulate a logical truth which we call the productivity principle. Rusell (Proc Lond Math Soc 4(2):29–53, 1906 ) was the first one to formulate this principle, but in a restricted form and with a different purpose. The principle explicates a logical mechanism that lies behind paradoxical multitudes, and is understandable as well as any simple logical truth. However, it does not explain the concept of set. It only sets logical bounds of the concept within the framework of the classical two valued $${\in}$$ -language. The principle behaves as a logical regulator of any theory we formulate to explain and describe sets. It provides tools to identify paradoxical classes inside the theory. We show how the known paradoxical classes follow from the productivity principle and how the principle gives us a uniform way to generate new paradoxical classes. In the case of ZFC set theory the productivity principle shows that the limitation of size principles are of a restrictive nature and that they do not explain which classes are sets. The productivity principle, as a logical regulator, can have a definite heuristic role in the development of a consistent set theory. We sketch such a theory—the cumulative cardinal theory of sets. The theory is based on the idea of cardinality of collecting objects into sets. Its development is guided by means of the productivity principle in such a way that its consistency seems plausible. Moreover, the theory inherits good properties from cardinal conception and from cumulative conception of sets. Because of the cardinality principle it can easily justify the replacement axiom, and because of the cumulative property it can easily justify the power set axiom and the union axiom. It would be possible to prove that the cumulative cardinal theory of sets is equivalent to the Morse–Kelley set theory. In this way we provide a natural and plausibly consistent axiomatization for the Morse–Kelley set theory. (shrink)

In 2001, W. Carnielli and Marcos considered a 3-valued logic in order to prove that the schema ϕ ∨ (ϕ → ψ) is not a theorem of da Costa’s logic Cω. In 2006, this logic was studied (and baptized) as G'3 by Osorio et al. as a tool to define semantics of logic programming. It is known that the truth-tables of G'3 have the same expressive power than the one of Łukasiewicz 3-valued logic as well as the one of Gödel (...) 3-valued logic G3. From this, the three logics coincide up-to language, taking into acccount that 1 is the only designated truth-value in these logics. -/- From the algebraic point of view, Canals-Frau and Figallo have studied the 3-valued modal implicative semilattices, where the modal operator is the well-known Moisil-Monteiro-Baaz Δ operator, and the supremum is definable from this. We prove that the subvariety obtained from this by adding a bottom element 0 is term-equivalent to the variety generated by the 3-valued algebra of G'3. The algebras of that variety are called G'3-algebras. From this result, we obtain the equations which axiomatize the variety of G'3-algebras. Moreover, we prove that this variety is semisimple, and the 3-element and the 2-element chains are the unique simple algebras of the variety. Finally an extension of G'3 to first-order languages is presented, with an algebraic semantics based on complete G'3-algebras. The corresponding soundness and completeness theorems are obtained. (shrink)

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)

Abstract Theories are metaphysically equivalent just if there is no fact of the matter that could render one theory true and the other false. In this paper I argue that if we are judiciously to resolve disputes about whether theories are equivalent or not, we need to develop testable criteria that will give us epistemic access to the obtaining of the relation of metaphysical equivalence holding between those theories. I develop such ?diagnostic? criteria. I argue that correctly inter-translatable (...) theories are metaphysically equivalent, and what we need are ways of determining whether a putative translation is correct or not. To that end I develop a number of tools we can employ to discern whether a translation is a correct one. (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.

This is part one of a two-part paper, in which we develop an axiomatic theory of the relation of partial ground. The main novelty of the paper is the of use of a binary ground predicate rather than an operator to formalize ground. This allows us to connect theories of partial ground with axiomatic theories of truth. In this part of the paper, we develop an axiomatization of the relation of partial ground over the truths of arithmetic and show that (...) the theory is a proof-theoretically conservative extension of the theory PT of positive truth. We construct models for the theory and draw some conclusions for the semantics of conceptualist ground. (shrink)

According to the analysis of concessive conditionals suggested by Crupi and Iacona, a concessive conditional \(p{{\,\mathrm{\hookrightarrow }\,}}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.

This is part two of a two-part paper in which we develop an axiomatic theory of the relation of partial ground. The main novelty of the paper is the of use of a binary ground predicate rather than an operator to formalize ground. In this part of the paper, we extend the base theory of the first part of the paper with hierarchically typed truth-predicates and principles about the interaction of partial ground and truth. We show that our theory is (...) a proof-theoretically conservative extension of the ramified theory of positive truth up to. (shrink)

A certain type of inference rules in modal logics, generalizing Gabbay's Irreflexivity rule, is introduced and some general completeness results about modal logics axiomatized with such rules are proved.

Formal criteria of theoretical equivalence are mathematical mappings between specific sorts of mathematical objects, notably including those objects used in mathematical physics. Proponents of formal criteria claim that results involving these criteria have implications that extend beyond pure mathematics. For instance, they claim that formal criteria bear on the project of using our best mathematical physics as a guide to what the world is like, and also have deflationary implications for various debates in the metaphysics of physics. In this paper, (...) I investigate whether there is a defensible view according to which formal criteria have significant non-mathematical implications, of these sorts or any other, reaching a chiefly negative verdict. Along the way, I discuss various foundational issues concerning how we use mathematical objects to describe the world when doing physics, and how this practice should inform metaphysics. I diagnose the prominence of formal criteria as stemming from contentious views on these foundational issues, and endeavor to motivate some alternative views in their stead. (shrink)

Prompted by the thesis that an organism’s umwelt possesses not just a descriptive dimension, but a normative one as well, some have sought to annex semiotics with ethics. Yet the pronouncements made in this vein have consisted mainly in rehearsing accepted moral intuitions, and have failed to concretely further our knowledge of why or how a creature comes to order objects in its environment in accordance with axiological charges of value or disvalue. For want of a more explicit account, theorists (...) writing on the topic have relied almost exclusively on semiotic insights about perception originally designed as part of a sophisticated refutation of idealism. The end result, which has been a form of direct givenness, has thus been far from convincing. In an effort to bring substance to the right-headed suggestion that values are rooted in the biological and conform to species-specific requirements, we present a novel conception that strives to make explicit the elemental structure underlying umwelt normativity. Building and expanding on the seminal work of Ayn Rand in metaethics, we describe values as an intertwined lattice which takes a creature’s own embodied life as its ultimate standard; and endeavour to show how, from this, all subsequent valuations can in principle be determined. (shrink)

Distributive justice deals with allocations of goods and bads within a group. Different principles and results of distributions are seen as possible ideals. Often those normative approaches are solely framed verbally, which complicates the application to different concrete distribution situations that are supposed to be evaluated in regard to justice. One possibility in order to frame this precisely and to allow for a fine-grained evaluation of justice lies in formal modelling of these ideals by metrics. Choosing a metric that is (...) supposed to map a certain ideal has to be justified. Such justification might be given by demanding specific substantiated axioms, which have to be met by a metric. This paper introduces such axioms for metrics of distributive justice shown by the example of needs-based justice. Furthermore, some exemplary metrics of needs-based justice and a three dimensional method for visualisation of non-comparative justice axioms or evaluations are presented. Therewith, a base worth discussing for the evaluation and modelling of metrics of distributive justice is given. (shrink)

A variation of Fitch’s paradox is given, where no special rules of inference are assumed, only axioms. These axioms follow from the familiar assumptions which involve rules of inference. We show (by constructing a model) that by allowing that possibly the knower doesn’t know his own soundness (while still requiring he be sound), Fitch’s paradox is avoided. Provided one is willing to admit that sound knowers may be ignorant of their own soundness, this might offer a way out of the (...) paradox. (shrink)

For many years I have maintained that I learned to philosophize by translating Francisco Suárez’s Metaphysical Disputation V from Latin into English. This surely is a claim that must sound extraordinary to the members of this audience or even to most twentieth century philosophers. Who reads Suárez these days? And what could I learn from a sixteenth century scholastic writer that would help me in the twentieth century? I would certainly be surprised if one were to find any references to (...) some of Suárez’s works in any of the works of twentieth-century major philosophers. One of the reasons for my claim is the great difficulty I had in figuring out what Suárez’s text means and how to render it understandable to English readers. Translating the text forced me to think in ways that were quite different from those I was used to think in Spanish, my native tongue, or English, my adoptive tongue. In fact, the translation I produced after having completed many drafts continued, and still continues to this day, to appear to me unsatisfactory, and that dissatisfaction was the key to understanding things I had understood very differently before. I hope to make clear why in what follows. The thesis that I defend is that semantic equivalence between texts of philosophy in different languages is difficult, if not impossible in some cases, to achieve and, therefore, that it is a mistake to restrict doing analytic philosophy to English, as Gustavo Rodríguez-Pereyra argues we should do in a recent article (2013). (shrink)

How ought you to evaluate your options if you're uncertain about what's fundamentally valuable? A prominent response is Expected Value Maximisation (EVM)—the view that under axiological uncertainty, an option is better than another if and only if it has the greater expected value across axiologies. But the expected value of an option depends on quantitative probability and value facts, and in particular on value comparisons across axiologies. We need to explain what it is for such facts to hold. Also, EVM (...) is by no means self-evident. We need an argument to defend that it’s true. This book introduces an axiomatic approach to answer these worries. It provides an explication of what EVM means by use of representation theorems: intertheoretic comparisons can be understood in terms of facts about which options are better than which, and mutatis mutandis for intratheoretic comparisons and axiological probabilities. And it provides a systematic argument to the effect that EVM is true: the theory can be vindicated through simple axioms. The result is a formally cogent and philosophically compelling extension of standard decision theory, and original take on the problem of axiological or normative uncertainty. (shrink)

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)

I investigate syntactic notions of theoretical equivalence between logical theories and a recent objection thereto. I show that this recent criticism of syntactic accounts, as extensionally inadequate, is unwarranted by developing an account which is plausibly extensionally adequate and more philosophically motivated. This is important for recent anti-exceptionalist treatments of logic since syntactic accounts require less theoretical baggage than semantic accounts.

We introduce the notions of syntactic synonymy and referential syn- onymy due to Moschovakis. Those notions are capable of accounting for fine- grained aspects of the meaning of linguistic expressions, by formalizing the Fregean distinction between sense and denotation. We integrate Moschovakis’s theory with the theory of concepts developed in the foundational ontology DOLCE, in order to enable a formal treatment of equivalence between concepts.

This paper corrects a mistake I saw students make but I have yet to see in print. The mistake is thinking that logically equivalent propositions have the same counterexamples—always. Of course, it is often the case that logically equivalent propositions have the same counterexamples: “every number that is prime is odd” has the same counterexamples as “every number that is not odd is not prime”. The set of numbers satisfying “prime but not odd” is the same as the (...) set of numbers satisfying “not odd but not not-prime”. The mistake is thinking that every two logically-equivalent false universal propositions have the same counterexamples. Only false universal propositions have counterexamples. A counterexample for “every two logically-equivalent false universal propositions have the same counterexamples” is two logically-equivalent false universal propositions not having the same counterexamples. The following counterexample arose naturally in my sophomore deductive logic course in a discussion of inner and outer converses. “Every even number precedes every odd number” is counterexemplified only by even numbers, whereas its equivalent “Every odd number is preceded by every even number” is counterexemplified only by odd numbers. Please let me know if you see this mistake in print. Also let me know if you have seen these points discussed before. I learned them in my own course: talk about learning by teaching! (shrink)

This paper presents a simple pair of first-order theories that are not definitionally (nor Morita) equivalent, yet are mutually conservatively translatable and mutually 'surjectively' translatable. We use these results to clarify the overall geography of standards of equivalence and to show that the structural commitments that theories make behave in a more subtle manner than has been recognized.

This paper is concerned with the relation between two notions: that of two solutions or models of a theory being related by a symmetry of the theory and that of solutions or models being physically equivalent. A number of authors have recently discussed this relation, some taking an optimistic view, on which there is a suitable concept of the symmetry of a theory relative to which these two notions coincide, others taking a pessimistic view, on which there is no (...) such concept. The present paper arrives at a cautiously pessimistic conclusion. (shrink)

Goethe's objections to Newton's theory of light and colours are better than often acknowledged. You can accept the most important elements of these objections without disagreeing with Newton about light and colours. As I will argue, Goethe exposed a crucial weakness of Newton's methodological self-assessment. Newton believed that with the help of his prism experiments, he could prove that sunlight was composed of variously coloured rays of light. Goethe showed that this step from observation to theory is more problematic than (...) Newton wanted to admit. By insisting that the step to theory is not forced upon us by the phenomena, Goethe revealed our own free, creative contribution to theory construction. And Goethe's insight is surprisingly significant, because he correctly claimed that all of the results of Newton's prism experiments fit a theoretical alternative equally well. If this is correct, then by suggesting an alternative to a well-established physical theory, Goethe developed the problem of underdete... (shrink)