Logic and Philosophy of Logic

Let S∞ denote the topological group of permutations of the natural numbers. A closed subgroup G of S∞ is called oligomorphic if for each n, its natural action on n-tuples of natural numbers has onl...

Neste trabalho, é apresentada uma investigação do que poderia ser chamado de formalização lógica do processo de mudança de teorias devido a anomalias. Por anomalia entende-se um fato observado que faz parte do escopo explanatório de uma teoria, mas que vai de encontro à previsão da mesma. Uma abordagem clássica para restaurar o poder explicativo de uma teoria ameaçada por uma anomalia é a postulação de hipóteses novas e provisórias que, em conjunto com as demais hipóteses auxiliares originais, sejam capazes (...) de resolver a anomalia. Após chegar à algumas conclusões sobre a estrutura de tal processo, propomos um framework lógico multimodal e não-monotônico capaz de representar alguns aspectos-chave dessa faceta importante da dinâmica de teorias científicas. Devido à necessidade de acomodar hipóteses provisórias incompatíveis, esse framework incorpora uma forma fraca de paraconsistência. Como um estudo de caso, analisamos o comportamento anômalo do planeta Urano que ameaçou a mecânica celeste Newtoniana por mais de meio século e ensejou a descoberta do planeta Netuno. (shrink)

In a recent paper, Barrio, Pailos and Szmuc show that there are logics that have exactly the validities of classical logic up to arbitrarily high levels of inference. They suggest that a logic therefore must be identified by its valid inferences at every inferential level. However, Scambler shows that there are logics with all the validities of classical logic at every inferential level, but with no antivalidities at any inferential level. Scambler concludes that in order to identify a logic, we (...) at least need to look at the validities and the antivalidities of every inferential level. In this paper, I argue that this is still not enough to identify a logic. I apply BPS’s techniques in a super/sub-valuationist setting to construct a logic that has exactly the validities and antivalidities of classical logic at every inferential level. I argue that the resulting logic is nevertheless distinct from classical logic. (shrink)

View more Abstract If logical truth is necessitated by sheer syntax, mathematics is categorially unlike logic even if all mathematics derives from definitions and logical principles. This contrast gets obscured by the plausibility of the Synonym Substitution Principle implicit in conceptions of analyticity: synonym substitution cannot alter sentence sense. The Principle obviously fails with intercepting: nonuniform term substitution in logical sentences. ‘Televisions are televisions’ and ‘TVs are televisions’ neither sound alike nor are used interchangeably. Interception synonymy gets assumed because logical (...) sentences and their synomic interceptions have identical factual content, which seems to exhaust semantic content. However, intercepting alters syntax by eliminating term recurrence, the sole strictly syntactic means of ensuring necessary term coextension, and thereby syntactically securing necessary truth. Interceptional necessity is lexical, a notational artifact. The denial of interception nonsynonymy and the disregard of term recurrence in logic link with many misconceptions about propositions, logical form, conventions, and metalanguages. Mathematics is distinct from logic: its truth is not syntactic; it is transmitted by synonym substitution; term recurrence has no essential role. The ‘=’ of mathematics is an objectual relation between numbers; the ‘=’ of logic marks a syntactic relation of coreferring terms. -/- . (shrink)

This is the book of abstracts of the 19th Brazilian Logic Conferences. The Brazilian Logic Conferences (EBL) is one of the most traditional logic conferences in South America. Organized by the Brazilian Logic Society (SBL), its main goal is to promote the dissemination of research in logic in a broad sense. It has been occurring since 1979, congregating logicians of different fields — mostly philosophy, mathematics and computer science — and with different backgrounds — from undergraduate students to senior researchers. (...) The meeting is an important moment for the Brazilian and South American logical community to join together and discuss recent developments of the field. The areas of logic covered in the conference spread over foundations and philosophy of science, analytic philosophy, philosophy and history of logic, mathematics, computer science, informatics, linguistics and artificial intelligence. Previous editions of the EBL have been a great success, attracting researchers from all over Latin America and elsewhere. -/- The 19th edition of EBL takes place from May 6-10, 2019, in the beautiful city of João Pessoa, at the northeast coast of Brazil. It is conjointly organized by Federal University of Paraíba (UFPB), whose main campus is located in João Pessoa, Federal University of Campina Grande (UFCG), whose main campus is located in the nearby city of Campina Grande (the second-largest city in Paraíba state) and SBL. It is sponsored by UFPB, UFCG, the Brazilian Council for Scientific and Technological Development (CNPq) and the State Ministry of Education, Science and Technology of Paraíba. It takes place at Hotel Luxxor Nord Tambaú, privileged located right in front Tambaú beach, one of João Pessoa’s most famous beaches. (shrink)

The recent development and exploration of mixed metainferential logics is a breakthrough in our understanding of nontransitive and nonreflexive logics. Moreover, this exploration poses a new challenge to theorists like me, who have appealed to similarities to classical logic in defending the logic ST, since some mixed metainferential logics seem to bear even more similarities to classical logic than ST does. There is a whole ST-based hierarchy, of which ST itself is only the first step, that seems to become more (...) and more classical at each level. I think this seeming is misleading: for certain purposes, anyhow, metainferential hierarchies give us no reason to move on from ST. ST is indeed only the first step on a grand metainferential adventure; but one step is enough. This paper aims to explain and defend that claim. Along the way, I take the opportunity also to develop some formal tools and results for thinking about metainferential logics more generally. (shrink)

In recent years, previously unknown aspects of Arthur Schopenhauer's œuvre have increasingly become the focus of various research efforts. Examples of this are Schopenhauer's philosophy of language...

The book Paraconsistent Logic: Consistency, Contradiction and Negation by Walter Carnielli and Marcelo Coniglio is the most thorough study of Logics of Formal Inconsistency...

TS is a logic that has no valid inferences. But, could there be a logic without valid metainferences? We will introduce TSω, a logic without metainferential validities. Notwithstanding, TSω is not as empty—i.e., uninformative—as it gets, because it has many antivalidities. We will later introduce the two-standard logic [TSω, STω], a logic without validities and antivalidities. Nevertheless, [TSω, STω] is still informative, because it has many contingencies. The three-standard logic [\] that we will further introduce, has no validities, no antivalidities (...) and also no contingencies whatsoever. We will also present two more validity-empty logics. The first one has no supersatisfiabilities, unsatisfabilities and antivalidities∗. The second one has no invalidities nor non-valid-nor-invalid inferences. All these considerations justify thinking of logics as, at least, three-standard entities, corresponding, respectively, to what someone who takes that logic as correct, accepts, rejects and suspends judgement about, just because those things are, respectively, validities, antivalidities and contingencies of that logic. Finally, we will present some consequences of this setting for the monism/pluralism/nihilism debate, and show how nihilism and monism, on one hand, and nihilism and pluralism, on the other hand, may reconcile—at least according to how Gillian Russell understands nihilism, and provide some general reasons for adopting a multi-standard approach to logics. (shrink)

The aim of this article is to study the notion of derivability and its semantic counterpart in the context of non-transitive and non-reflexive substructural logics. For this purpose we focus on the study cases of the logics ST and TS. In this respect, we show that this notion doesn’t coincide, in general, with a nowadays broadly used semantic approach towards metainferential validity: the notion of local validity. Following this, and building on some previous work by Humberstone, we prove that in (...) these systems derivability can be characterized in terms of a notion we call absolute global validity. However, arriving at these results doesn’t lead us to disregard local validity. First, because we discuss the conditions under which local, and also global validity, can be expected to coincide with derivability. Secondly, because we show how taking into account certain families of valuations can be useful to describe derivability for different calculi used to present ST and TS. (shrink)

Journal of Mathematical Logic, Ahead of Print.

If we replace first-order logic by second-order logic in the original definition of Gödel’s inner model L, we obtain the inner model of hereditarily ordinal definable sets [33]. In this paper...

Anti-elementarity is a strong way of ensuring that a class of structures, in a given first-order language, is not closed under elementary equivalence with respect to any infinitary language of the...

We develop “local NIP group theory” in the context of pseudofinite groups. In particular, given a sufficiently saturated pseudofinite structure G expanding a group, and left invariant NIP formula δ...

We define the interpolative fusion T∪∗ of a family i∈I of first-order theories over a common reduct T∩, a notion that generalizes many examples of random or generic structures in the model-theo...

Let T be a complete, model complete o-minimal theory extending the theory RCF of real closed ordered fields in some appropriate language L. We study derivations δ on models ℳ⊧T. We introduce the no...

We prove rigidity results for large classes of corona algebras, assuming the Proper Forcing Axiom. In particular, we prove that a conjecture of Coskey and Farah holds for all separable C∗-algebras...

We generalize Kada’s definable strengthening of Dilworth’s characterization of the class of quasi-orders admitting an antichain of a given finite cardinality.

We prove a generalization of the Elekes–Szabó theorem [G. Elekes and E. Szabó, How to find groups?, Combinatorica 32 537–571 ] for relations defina...

Starting with two supercompact cardinals we produce a generic extension of the universe in which a principle that we call GM+ holds. This principle implies ISP and ISP, and hence th...

This special issue of Logica Universalis (Springer) deals with the relations between logic and religion, broadly conceived. It contains the following articles: Logic and Religion, by Jean-Yves Beziau and Ricardo Silvestre; Thinking Negation in Early Hinduism and Classical Indian Philosophy, by Purushottama Bilimoria; Karma Theory, Determinism, Fatalism and Freedom of Will, by Ricardo Sousa Silvestre; From Logic in Islam to Islamic Logic, by Musa Akrami; Leibniz’s Ontological Proof of the Existence of God and the Problem of Impossible Objects, by Wolfgang (...) Lenzen; A Logical Analysis of the Anselm’s Unum Argumentum (from Proslogion), by Jean-Pierre Desclés; Monotonic and Non-monotonic Embeddings of Anselm’s Proof, by Jacob Archambault; Computer-Assisted Analysis of the Anderson–Hájek Ontological Controversy, by C. Benzmüller, L. Weber and B. Woltzenlogel Paleo. (shrink)

A common argument in support of a beginning of the universe used by advocates of the kalām cosmological argument (KCA) is the argument against the possibility of an actual infinite, or the “Infinity Argument”. However, it turns out that the Infinity Argument loses some of its force when compared with the achievements of set theory and it brings into question the view that God predetermined an endless future. We therefore defend a new formal argument, based on the nature of time (...) (just as geometrical reasoning is based on the nature of space), which addresses more directly the question of beginningless time. (shrink)

Hume’s famous character Cleanthes claims that there is no difficulty in explaining the existence of causal chains with no first cause since in them each item is causally explained by its predecessor. Relying on logico-mathematical resources, we argue for two theses: (1) if the existence of Cleanthes’ chain can be explained at all, it must be explained by the fact that the causal law ruling it is in force, and (2) the fact that such a causal law is in force (...) cannot explain the occurrence of the events in the chain. In order to perform (1), we manage to express in mathematical terms the intuitive idea that indefinitely delayed explanation is ultimately no explanation. In order to achieve (2), we identify a logical relation we can prove to be as strong as the causal relation at issue in the Cleanthes passage, according to a precise notion of strength of relations. (shrink)

We develop and defend a new approach to counterlogicals. Non-vacuous counterlogicals, we argue, fall within a broader class of counterfactuals known as counterconventionals. Existing semantics for counterconventionals, 459–482 ) and, 1–27 ) allow counterfactuals to shift the interpretation of predicates and relations. We extend these theories to counterlogicals by allowing counterfactuals to shift the interpretation of logical vocabulary. This yields an elegant semantics for counterlogicals that avoids problems with the usual impossible worlds semantics. We conclude by showing how this approach (...) can be extended to counterpossibles more generally. (shrink)

Lattice logic, bilattice logic, and paraconsistent quantum logic are investigated based on monosequent systems. Paraconsistent quantum logic is an extension of lattice logic, and bilattice logic is an extension of paraconsistent quantum logic. Monosequent system is a sequent calculus based on the restricted sequent that contains exactly one formula in both the antecedent and succedent. It is known that a completeness theorem with respect to a lattice-valued semantics holds for a monosequent system for lattice logic. A completeness theorem with respect (...) to a lattice-valued semantics is proved for paraconsistent quantum logic, and a completeness theorem with respect to a bilattice-valued semantics is proved for bilattice logic. Some syntactical properties, including cut-elimination and duality, are also investigated for the monosequent systems for these logics. (shrink)

The basic quasi-Boolean negation expansions of relevance logics included in Anderson and Belnap’s relevance logic R are defined. We consider two types of QB-negation: H-negation and D-negation. The former one is of paraintuitionistic or superintuitionistic character, the latter one, of dual intuitionistic nature in some sense. Logics endowed with H-negation are paracomplete; logics with D-negation are paraconsistent. All logics defined in the paper are given a Routley-Meyer ternary relational semantics.

David Kaplan observed in Kaplan that the principle \\) cannot be verified at a world in a standard possible worlds model for a quantified bimodal propositional language. This raises a puzzle for certain interpretations of the operator Q: it seems that some proposition p is such that is not possible to query p, and p alone. On the other hand, Arthur Prior had observed in Prior that on pain of contradiction, ∀p is Q only if one true proposition is Q (...) and one false proposition is Q. The two observations are related: ∀p is elusive in that it is not possible for the proposition to be uniquely Q. Kaplan based his model-theoretic observation on Cantor’s theorem, but there is a less well-known link between this simple set-theoretic observation and Prior’s remark. We generalize the link to develop a heuristic designed to move from Cantor’s theorem to the observation that a variety of sentences of the bimodal language express propositions that cannot be Q uniquely. We highlight the analogy between some of these results and some set-theoretic antinomies and suggest that the phenomenon is richer than one may have anticipated. (shrink)

In his Doppelvortrag, Edmund Husserl introduced two concepts of “definiteness” which have been interpreted as a vindication of his role in the history of completeness. Some commentators defended that the meaning of these notions should be understood as categoricity, while other scholars believed that it is closer to syntactic completeness. A detailed study of the early twentieth-century axiomatics and Husserl’s Doppelvortrag shows, however, that many concepts of completeness were conflated as equivalent. Although “absolute definiteness” was principally an attempt to characterize (...) non-extendible manifolds and axiom systems, an absolutely definite theory has a unique model and, thus, it is non-forkable and semantically complete. Non-forkability and decidability were formally delimited by Fraenkel and Carnap almost three decades later and, in fact, they mentioned Husserl as precursor of the latter. Therefore, this paper contributes to a reassessment of Husserl’s place in the history of logic. (shrink)

Some arguments include imperative clauses. For example: ‘Buy me a drink; you can’t buy me that drink unless you go to the bar; so, go to the bar!’ How should we build a logic that predicts which of these arguments are good? Because imperatives aren’t truth apt and so don’t stand in relations of truth preservation, this technical question gives rise to a foundational one: What would be the subject matter of this logic? I argue that declaratives are used to (...) produce beliefs, imperatives are used to produce intentions, and beliefs and intentions are subject to rational requirements. An argument will strike us as valid when anyone whose mental state satisfies the premises is rationally required to satisfy the conclusion. For example, the above argument reflects the principle that it is irrational not to intend what one takes to be the necessary means to one’s intended ends. I argue that all intuitively good patterns of imperative inference can be explained using off-the-shelf formulations of our rational requirements. I then develop a formal-semantic theory embodying this view that predicts a range of data, including free-choice effects and Ross’s paradox. The resulting theory shows one way that our aspirations to rational agency can be discerned in the patterns of our speech, and is a case study in how the philosophy of language and the philosophy of action can be mutually illuminating. (shrink)

The application of paraconsistent logics to theological contradictions is a fascinating move. Jc Beall’s (J Anal Theol, 7(1): 400–439, 2019) paper entitled ‘Christ—A Contradiction: A Defense of ‘Contradictory Christology’ is a notable example. Beall proposes a solution to the fundamental problem of Christology. His solution aims at making the case, and defending the viability of, what he has termed, ‘Contradictory Christology’. There are at least two essential components of Beall’s ‘Contradictory Christology’. These include the dogmatic statements of Chalcedon and FDE (...) logic. The first is the theological contradiction in question. The second is the type of paraconsistent logic. Both components are integral to a contradictory theology in general. I argue that there can be no such thing as an Islamic contradictory theology. I make the case by establishing two points. These points correspond to both integral components of a contradictory theology in general. The first is that an Islamic theological contradiction does not entail an actual (logical) contradiction. The second is that FDE logic, including alternative sub-classical systems of logic, are not adequate in tolerating an Islamic theological contradiction. (shrink)

K. R. Popper distinguished between two main uses of logic, the demonstrational one, in mathematical proofs, and the derivational one, in the empirical sciences. These two uses are governed by the following methodological constraints: in mathematical proofs one ought to use minimal logical means (logical minimalism), while in the empirical sciences one ought to use the strongest available logic (logical maximalism). In this paper I discuss whether Popper’s critical rationalism is compatible with a revision of logic in the empirical sciences, (...) given the condition of logical maximalism. Apparently, if one ought to use the strongest logic in the empirical sciences, logic would remain immune to criticism and, thus, non-revisable. I will show that critical rationalism is theoretically compatible with a revision of logic in the empirical sciences. However, a question that remains to be clarified by the critical rationalists is what kind of evidence would lead them to revise the system of logic that underlies a physical theory, such as quantum mechanics? Popper’s falsificationist methodology will be compared with the recently advocated extension of the abductive methodology from the empirical sciences to logic by T. Williamson, since both of them arrive at the same conclusion concerning the status of classical logic. (shrink)

Let be the class of odd involutive even the notion of partial lex products is not sufficiently general. One more tweak is needed, a slightly even more complex construction, called partial sublex product, introduced here.

Positive monotone modal logic is the negation- and implication-free fragment of monotone modal logic, i.e., the fragment with connectives and. We axiomatise positive monotone modal logic, give monotone neighbourhood semantics based on posets, and prove soundness and completeness. The latter follows from the main result of this paper: a duality between so-called \-spaces and the algebraic semantics of positive monotone modal logic. The main technical tool is the use of coalgebra.

In topological spaces, the relation of extended contact is a ternary relation that holds between regular closed subsets A, B and D if the intersection of A and B is included in D. The algebraic counterpart of this mereotopological relation is the notion of extended contact algebra which is a Boolean algebra extended with a ternary relation. In this paper, we are interested in the relational representation theory for extended contact algebras. In this respect, we study the correspondences between point-free (...) and point-based models of space in terms of extended contact. More precisely, we prove new representation theorems for extended contact algebras. (shrink)

The language of Belnap–Dunn modal logic \ expands the language of Belnap–Dunn four-valued logic with the modal operator \. We introduce the polarity semantics for \ and its two expansions \ and \ with value operators. The local finitary consequence relation \ in the language \ with respect to the class of all frames is axiomatized by a sequent system \ where \. We prove by using translations between sequents and formulas that these languages under the polarity semantics have the (...) same expressive power on the level of frames with the language \ under the relational semantics for classical modal logic. (shrink)

C. I. Lewis’ systems were the first axiomatisations of modal logics. However some of those systems are non-normal modal logics, since they do not admit a full rule of necessitation, but only a restricted version thereof. We provide G3-style labelled sequent calculi for Lewis’ non-normal propositional systems. The calculi enjoy good structural properties, namely admissibility of structural rules and admissibility of cut. Furthermore they allow for straightforward proofs of admissibility of the restricted versions of the necessitation rule. We establish completeness (...) of the calculi and we discuss also related systems. (shrink)

Is it possible to combine different logics into a coherent system with the goal of applying it to specific problems so that it sheds some light on foundational aspects of those logics? These are two of the most basic issues of combining logics. Paranormal modal logic is a combination of paraconsistent logic and modal logic. In this paper, I propose two further combinatory developments, focusing on each one of these two issues. On the foundational side, I combine paranormal modal logic (...) with normal modal logic, resulting into a paraconsistent and paracomplete multimodal logic dealing with the notions of plausibility and certainty. On the application side, I combine this logic with Reiter’s default logic, resulting into an inductive and consequently nonmonotonic paraconsistent and paracomplete logic able to represent some key inductive principles. (shrink)