Related categories

6944 found
Order:
1 — 50 / 6944
Material to categorize
  1. Routley Star and Hyperintensionality.Sergei Odintsov & Heinrich Wansing - forthcoming - Journal of Philosophical Logic:1-24.
    We compare the logic HYPE recently suggested by H. Leitgeb as a basic propositional logic to deal with hyperintensional contexts and Heyting-Ockham logic introduced in the course of studying logical aspects of the well-founded semantics for logic programs with negation. The semantics of Heyting-Ockham logic makes use of the so-called Routley star negation. It is shown how the Routley star negation can be obtained from Dimiter Vakarelov’s theory of negation and that propositional HYPE coincides with the logic characterized by the (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  2. Epimorphism Surjectivity in Varieties of Heyting Algebras.T. Moraschini & J. J. Wannenburg - 2020 - Annals of Pure and Applied Logic 171 (9):102824.
    It was shown recently that epimorphisms need not be surjective in a variety K of Heyting algebras, but only one counter-example was exhibited in the literature until now. Here, a continuum of such examples is identified, viz. the variety generated by the Rieger-Nishimura lattice, and all of its (locally finite) subvarieties that contain the original counter-example K . It is known that, whenever a variety of Heyting algebras has finite depth, then it has surjective epimorphisms. In contrast, we show that (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3. Double Negation Semantics for Generalisations of Heyting Algebras.Rob Arthan & Paulo Oliva - forthcoming - Studia Logica:1-25.
    This paper presents an algebraic framework for investigating proposed translations of classical logic into intuitionistic logic, such as the four negative translations introduced by Kolmogorov, Gödel, Gentzen and Glivenko. We view these as variant semantics and present a semantic formulation of Troelstra’s syntactic criteria for a satisfactory negative translation. We consider how each of the above-mentioned translation schemes behaves on two generalisations of Heyting algebras: bounded pocrims and bounded hoops. When a translation fails for a particular class of algebras, we (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4. The Normal and Self-Extensional Extension of Dunn–Belnap Logic.Arnon Avron - forthcoming - Logica Universalis:1-16.
    A logic \ is called self-extensional if it allows to replace occurrences of a formula by occurrences of an \-equivalent one in the context of claims about logical consequence and logical validity. It is known that no three-valued paraconsistent logic which has an implication can be self-extensional. In this paper we show that in contrast, the famous Dunn–Belnap four-valued logic has exactly one self-extensional four-valued extension which has an implication. We also investigate the main properties of this logic, determine the (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5. Eigenlogic in the Spirit of George Boole.Zeno Toffano - 2020 - Logica Universalis 14 (2):175-207.
    This work presents an operational and geometric approach to logic. It starts from the multilinear elective decomposition of binary logical functions in the original form introduced by George Boole. A justification on historical grounds is presented bridging Boole’s theory and the use of his arithmetical logical functions with the axioms of Boolean algebra using sets and quantum logic. It is shown that this algebraic polynomial formulation can be naturally extended to operators in finite vector spaces. Logical operators will appear as (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6. Positive Amalgamation.Mohammed Belkasmi - 2020 - Logica Universalis 14 (2):243-258.
    We study the amalgamation property in positive logic, where we shed light on some connections between the amalgamation property, Robinson theories, model-complete theories and the Hausdorff property.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7. Modal Extension of Ideal Paraconsistent Four-Valued Logic and its Subsystem.Norihiro Kamide & Yoni Zohar - 2020 - Annals of Pure and Applied Logic 171 (10):102830.
    This study aims to introduce a modal extension M4CC of Arieli, Avron, and Zamansky's ideal paraconsistent four-valued logic 4CC as a Gentzen-type sequent calculus and prove the Kripke-completeness and cut-elimination theorems for M4CC. The logic M4CC is also shown to be decidable and embeddable into the normal modal logic S4. Furthermore, a subsystem of M4CC, which has some characteristic properties that do not hold for M4CC, is introduced and the Kripke-completeness and cut-elimination theorems for this subsystem are proved. This subsystem (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  8. Algebraically Closed Structures in Positive Logic.Mohammed Belkasmi - 2020 - Annals of Pure and Applied Logic 171 (9):102822.
    In this paper we extend of the notion of algebraically closed given in the case of groups and skew fields to an arbitrary h-inductive theory. The main subject of this paper is the study of the notion of positive algebraic closedness and its relationship with the notion of positive closedness and the amalgamation property.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9. Brouwer’s Weak Counterexamples and the Creative Subject: A Critical Survey.Peter Fletcher - forthcoming - Journal of Philosophical Logic:1-47.
    I survey Brouwer’s weak counterexamples to classical theorems, with a view to discovering what useful mathematical work is done by weak counterexamples; whether they are rigorous mathematical proofs or just plausibility arguments; the role of Brouwer’s notion of the creative subject in them, and whether the creative subject is really necessary for them; what axioms for the creative subject are needed; what relation there is between these arguments and Brouwer’s theory of choice sequences. I refute one of Brouwer’s claims with (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  10. A Refined Interpretation of Intuitionistic Logic by Means of Atomic Polymorphism.José Espírito Santo & Gilda Ferreira - 2020 - Studia Logica 108 (3):477-507.
    We study an alternative embedding of IPC into atomic system F whose translation of proofs is based, not on instantiation overflow, but instead on the admissibility of the elimination rules for disjunction and absurdity. As compared to the embedding based on instantiation overflow, the alternative embedding works equally well at the levels of provability and preservation of proof identity, but it produces shorter derivations and shorter simulations of reduction sequences. Lambda-terms are employed in the technical development so that the algorithmic (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  11. Interpolation in Extensions of First-Order Logic.Guido Gherardi, Paolo Maffezioli & Eugenio Orlandelli - 2020 - Studia Logica 108 (3):619-648.
    We prove a generalization of Maehara’s lemma to show that the extensions of classical and intuitionistic first-order logic with a special type of geometric axioms, called singular geometric axioms, have Craig’s interpolation property. As a corollary, we obtain a direct proof of interpolation for first-order logic with identity, as well as interpolation for several mathematical theories, including the theory of equivalence relations, partial and linear orders, and various intuitionistic order theories such as apartness and positive partial and linear orders.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12. Completeness and Cut-Elimination for First-Order Ideal Paraconsistent Four-Valued Logic.Norihiro Kamide & Yoni Zohar - 2020 - Studia Logica 108 (3):549-571.
    In this study, we prove the completeness and cut-elimination theorems for a first-order extension F4CC of Arieli, Avron, and Zamansky’s ideal paraconsistent four-valued logic known as 4CC. These theorems are proved using Schütte’s method, which can simultaneously prove completeness and cut-elimination.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13. Rosser Provability and Normal Modal Logics.Taishi Kurahashi - 2020 - Studia Logica 108 (3):597-617.
    In this paper, we investigate Rosser provability predicates whose provability logics are normal modal logics. First, we prove that there exists a Rosser provability predicate whose provability logic is exactly the normal modal logic \. Secondly, we introduce a new normal modal logic \ which is a proper extension of \, and prove that there exists a Rosser provability predicate whose provability logic includes \.
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  14. Simplified Kripke-Style Semantics for Some Normal Modal Logics.Andrzej Pietruszczak, Mateusz Klonowski & Yaroslav Petrukhin - 2020 - Studia Logica 108 (3):451-476.
    Pietruszczak :163–171, 2009. https://doi.org/10.12775/LLP.2009.013) proved that the normal logics \, \ ), \ are determined by suitable classes of simplified Kripke frames of the form \, where \. In this paper, we extend this result. Firstly, we show that a modal logic is determined by a class composed of simplified frames if and only if it is a normal extension of \. Furthermore, a modal logic is a normal extension of \ ; \; \) if and only if it is (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  15. Paraconsistent Logics From a Philosophical Point of View.Diogo Dias - 2012 - Cognitio-Estudos 9 (2):139-148.
    This article begins with a general and abstract definition of logic and, particularly, of paraconsistent logics, to establish a common ground for the discussion. Briefly stating, these kinds of logics have the property of being non-explosive, that is, it is not possible to infer any conclusion from contradictory premises. Using these definitions, it is possible to analyze some of the philosophical aspects of paraconsistent logics, in particular, the relation between the notion of explosion and the law of non-contradiction, as well (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  16. A Note on FDE “All the Way Up”.Jc Beall & Caleb Camrud - 2020 - Notre Dame Journal of Formal Logic 61 (2):283-296.
    A very natural and philosophically important subclassical logic is FDE. This account of logical consequence can be seen as going beyond the standard two-valued account to a four-valued account. A natural question arises: What account of logical consequence arises from considering further combinations of such values? A partial answer was given by Priest in 2014; Shramko and Wansing had also given a partial result some years earlier, although in a different context. In this note we generalize Priest’s result to show (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  17. Formal Notes on the Substitutional Analysis of Logical Consequence.Volker Halbach - 2020 - Notre Dame Journal of Formal Logic 61 (2):317-339.
    Logical consequence in first-order predicate logic is defined substitutionally in set theory augmented with a primitive satisfaction predicate: an argument is defined to be logically valid if and only if there is no substitution instance with true premises and a false conclusion. Substitution instances are permitted to contain parameters. Variants of this definition of logical consequence are given: logical validity can be defined with or without identity as a logical constant, and quantifiers can be relativized in substitution instances or not. (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  18. The Symbolic Epistemological Implications of the Different Mythological Set Up of the (Egyptian)-Mesopotamian Culture Compared to the Grecian One.Donato Santarcangelo - 2017 - Enkelados 6.
    The Mesopotamian peoples were never really dominated by the reason the way we conceptualize it. It's to the revelation as direct emanation of the divine that they ascribed the appearance of knowledge.".
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  19. Belnap–Dunn Modal Logics: Truth Constants Vs. Truth Values.Sergei P. Odintsov & Stanislav O. Speranski - 2020 - Review of Symbolic Logic 13 (2):416-435.
    We shall be concerned with the modal logic BK—which is based on the Belnap–Dunn four-valued matrix, and can be viewed as being obtained from the least normal modal logic K by adding ‘strong negation’. Though all four values ‘truth’, ‘falsity’, ‘neither’ and ‘both’ are employed in its Kripke semantics, only the first two are expressible as terms. We show that expanding the original language of BK to include constants for ‘neither’ or/and ‘both’ leads to quite unexpected results. To be more (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  20. A Fully Classical Truth Theory Characterized by Substructural Means.Federico Matías Pailos - 2020 - Review of Symbolic Logic 13 (2):249-268.
    We will present a three-valued consequence relation for metainferences, called CM, defined through ST and TS, two well known substructural consequence relations for inferences. While ST recovers every classically valid inference, it invalidates some classically valid metainferences. While CM works as ST at the inferential level, it also recovers every classically valid metainference. Moreover, CM can be safely expanded with a transparent truth predicate. Nevertheless, CM cannot recapture every classically valid meta-metainference. We will afterwards develop a hierarchy of consequence relations (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  21. Kripke Semantics for Intuitionistic Łukasiewicz Logic.A. Lewis-Smith, P. Oliva & E. Robinson - forthcoming - Studia Logica:1-27.
    This paper proposes a generalization of the Kripke semantics of intuitionistic logic IL appropriate for intuitionistic Łukasiewicz logic IŁL — a logic in the intersection between IL and (classical) Łukasiewicz logic. This generalised Kripke semantics is based on the poset sum construction, used in Bova and Montagna (Theoret Comput Sci 410(12):1143–1158, 2009) to show the decidability (and PSPACE completeness) of the quasiequational theory of commutative, integral and bounded GBL algebras. The main idea is that w \Vdash \sigma—which for IL is (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  22. Two New Series of Principles in the Interpretability Logic of All Reasonable Arithmetical Theories.Evan Goris & Joost J. Joosten - 2020 - Journal of Symbolic Logic 85 (1):1-25.
    The provability logic of a theory T captures the structural behavior of formalized provability in T as provable in T itself. Like provability, one can formalize the notion of relative interpretability giving rise to interpretability logics. Where provability logics are the same for all moderately sound theories of some minimal strength, interpretability logics do show variations.The logic IL is defined as the collection of modal principles that are provable in any moderately sound theory of some minimal strength. In this article (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  23. Chaitin’s Ω as a Continuous Function.Rupert Hölzl, Wolfgang Merkle, Joseph Miller, Frank Stephan & Liang Yu - 2020 - Journal of Symbolic Logic 85 (1):486-510.
    We prove that the continuous function${\rm{\hat \Omega }}:2^\omega \to $ that is defined via$X \mapsto \mathop \sum \limits_n 2^{ - K\left} $ for all $X \in {2^\omega }$ is differentiable exactly at the Martin-Löf random reals with the derivative having value 0; that it is nowhere monotonic; and that $\mathop \smallint \nolimits _0^1{\rm{\hat{\Omega }}}\left\,{\rm{d}}X$ is a left-c.e. $wtt$-complete real having effective Hausdorff dimension ${1 / 2}$.We further investigate the algorithmic properties of ${\rm{\hat{\Omega }}}$. For example, we show that the maximal (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24. Proof Vs Provability: On Brouwer’s Time Problem.Palle Yourgrau - 2020 - History and Philosophy of Logic 41 (2):140-153.
    Is a mathematical theorem proved because provable, or provable because proved? If Brouwer’s intuitionism is accepted, we’re committed, it seems, to the latter, which is highly problematic. Or so I will argue. This and other consequences of Brouwer’s attempt to found mathematics on the intuition of a move of time have heretofore been insufficiently appreciated. Whereas the mathematical anomalies of intuitionism have received enormous attention, too little time, I’ll try to show, has been devoted to some of the temporal anomalies (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  25. Exactly True and Non-Falsity Logics Meeting Infectious Ones.Alex Belikov & Yaroslav Petrukhin - forthcoming - Journal of Applied Non-Classical Logics:1-29.
    In this paper, we study logical systems which represent entailment relations of two kinds. We extend the approach of finding ‘exactly true’ and ‘non-falsity’ versions of four-valued logics that emerged in series of recent works [Pietz & Rivieccio (2013). Nothing but the truth. Journal of Philosophical Logic, 42(1), 125–135; Shramko (2019). Dual-Belnap logic and anything but falsehood. Journal of Logics and their Applications, 6, 413–433; Shramko et al. (2017). First-degree entailment and its relatives. Studia Logica, 105(6), 1291–1317] to the case (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  26. Univalent polymorphism.Benno van den Berg - 2020 - Annals of Pure and Applied Logic 171 (6):102793.
    We show that Martin Hyland's effective topos can be exhibited as the homotopy category of a path category EFF. Path categories are categories of fibrant objects in the sense of Brown satisfying two additional properties and as such provide a context in which one can interpret many notions from homotopy theory and Homotopy Type Theory. Within the path category EFF one can identify a class of discrete fibrations which is closed under push forward along arbitrary fibrations (in other words, this (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  27. Bilattice Logic of Epistemic Actions and Knowledge.Zeinab Bakhtiari, Hans van Ditmarsch & Umberto Rivieccio - 2020 - Annals of Pure and Applied Logic 171 (6):102790.
    Baltag, Moss, and Solecki proposed an expansion of classical modal logic, called logic of epistemic actions and knowledge (EAK), in which one can reason about knowledge and change of knowledge. Kurz and Palmigiano showed how duality theory provides a flexible framework for modeling such epistemic changes, allowing one to develop dynamic epistemic logics on a weaker propositional basis than classical logic (for example an intuitionistic basis). In this paper we show how the techniques of Kurz and Palmigiano can be further (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  28. An Algebraic Study of Tense Operators on Nelson Algebras.A. V. Figallo, G. Pelaitay & J. Sarmiento - forthcoming - Studia Logica:1-28.
    Ewald considered tense operators G, H, F and P on intuitionistic propositional calculus and constructed an intuitionistic tense logic system called IKt. In 2014, Figallo and Pelaitay introduced the variety IKt of IKt-algebras and proved that the IKt system has IKt-algebras as algebraic counterpart. In this paper, we introduce and study the variety of tense Nelson algebras. First, we give some examples and we prove some properties. Next, we associate an IKt-algebra to each tense Nelson algebras. This result allowed us (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  29. Intuitionistic Non-normal Modal Logics: A General Framework.Tiziano Dalmonte, Charles Grellois & Nicola Olivetti - forthcoming - Journal of Philosophical Logic:1-50.
    We define a family of intuitionistic non-normal modal logics; they can be seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only Necessity or Possibility. We then consider the more important case of bimodal logics, which contain both modal operators. In this case we define several interactions between Necessity and Possibility of increasing strength, although weaker than duality. We thereby obtain a lattice of 24 distinct bimodal logics. For all logics we provide both a Hilbert (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  30. Countably Many Weakenings of Belnap–Dunn Logic.Minghui Ma & Yuanlei Lin - 2020 - Studia Logica 108 (2):163-198.
    Every Berman’s variety \ which is the subvariety of Ockham algebras defined by the equation \ and \) determines a finitary substitution invariant consequence relation \. A sequent system \ is introduced as an axiomatization of the consequence relation \. The system \ is characterized by a single finite frame \ under the frame semantics given for the formal language. By the duality between frames and algebras, \ can be viewed as a \-valued logic as it is characterized by a (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  31. Simple Axiomatizations for Pretabular Classical Relevance Logics.Asadollah Fallahi - 2020 - Studia Logica 108 (2):359-393.
    KR is Anderson and Belnap’s relevance logic R with the addition of the axiom of EFQ: \ \rightarrow q\). Since KR is relevantistic as to implication but classical as to negation, it has been dubbed, among many others, a ‘classical relevance logic.’ For KR, there have been known so far just two pretabular normal extensions. For these pretabular logics, no simple axiomatizations have yet been presented. In this paper, we offer some and show that they do the job. We also (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  32. The Peripatetic Program in Categorical Logic: Leibniz on Propositional Terms.Marko Malink & Anubav Vasudevan - 2020 - Review of Symbolic Logic 13 (1):141-205.
    Greek antiquity saw the development of two distinct systems of logic: Aristotle’s theory of the categorical syllogism and the Stoic theory of the hypothetical syllogism. Some ancient logicians argued that hypothetical syllogistic is more fundamental than categorical syllogistic on the grounds that the latter relies on modes of propositional reasoning such as reductio ad absurdum. Peripatetic logicians, by contrast, sought to establish the priority of categorical over hypothetical syllogistic by reducing various modes of propositional reasoning to categorical form. In the (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  33. Structures of Opposition and Comparisons: Boolean and Gradual Cases.Didier Dubois, Henri Prade & Agnès Rico - 2020 - Logica Universalis 14 (1):115-149.
    This paper first investigates logical characterizations of different structures of opposition that extend the square of opposition in a way or in another. Blanché’s hexagon of opposition is based on three disjoint sets. There are at least two meaningful cubes of opposition, proposed respectively by two of the authors and by Moretti, and pioneered by philosophers such as J. N. Keynes, W. E. Johnson, for the former, and H. Reichenbach for the latter. These cubes exhibit four and six squares of (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  34. On the Historical Transformations of the Square of Opposition as Semiotic Object.Ioannis M. Vandoulakis & Tatiana Yu Denisova - 2020 - Logica Universalis 14 (1):7-26.
    In this paper, we would show how the logical object “square of opposition”, viewed as semiotic object, has been historically transformed since its appearance in Aristotle’s texts until the works of Vasiliev. These transformations were accompanied each time with a new understanding and interpretation of Aristotle’s original text and, in the last case, with a transformation of its geometric configuration. The initial textual codification of the theory of opposition in Aristotle’s works is transformed into a diagrammatic one, based on a (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  35. A Conservative Negation Extension of Positive Semilattice Logic Without the Finite Model Property.Yale Weiss - forthcoming - Studia Logica:1-12.
    In this article, I present a semantically natural conservative extension of Urquhart’s positive semilattice logic with a sort of constructive negation. A subscripted sequent calculus is given for this logic and proofs of its soundness and completeness are sketched. It is shown that the logic lacks the finite model property. I discuss certain questions Urquhart has raised concerning the decision problem for the positive semilattice logic in the context of this logic and pose some problems for further research.
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  36. Semi De Morgan Logic Properly Displayed.Giuseppe Greco, Fei Liang, M. Andrew Moshier & Alessandra Palmigiano - forthcoming - Studia Logica:1-45.
    In the present paper, we endow semi De Morgan logic and a family of its axiomatic extensions with proper multi-type display calculi which are sound, complete, conservative, and enjoy cut elimination and subformula property. Our proposal builds on an algebraic analysis of the variety of semi De Morgan algebras, and applies the guidelines of the multi-type methodology in the design of display calculi.
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  37. A General Framework for $$ {FDE}$$FDE -Based Modal Logics.Sergey Drobyshevich - forthcoming - Studia Logica:1-26.
    We develop a general theory of FDE-based modal logics. Our framework takes into account the four-valued nature of FDE by considering four partially defined modal operators corresponding to conditions for verifying and falsifying modal necessity and possibility operators. The theory comes with a uniform characterization for all obtained systems in terms of FDE-style formula-formula sequents. We also develop some correspondence theory and show how Hilbert-style axiom systems can be obtained in appropriate cases. Finally, we outline how different systems from the (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  38. A Canonical Model for Constant Domain Basic First-Order Logic.Ben Middleton - forthcoming - Studia Logica:1-17.
    I build a canonical model for constant domain basic first-order logic (BQLCD), the constant domain first-order extension of Visser’s basic propositional logic, and use the canonical model to verify that BQLCD satisfies the disjunction and existence properties.
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  39. Transfinite Meta-inferences.Chris Scambler - forthcoming - Journal of Philosophical Logic:1-11.
    In Barrio et al. Barrio Pailos and Szmuc prove that there are systems of logic that agree with classical logic up to any finite meta-inferential level, and disagree with it thereafter. This article presents a generalized sense of meta-inference that extends into the transfinite, and proves analogous results to all transfinite orders.
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  40. A State-of-Affairs-Semantic Solution to the Problem of Extensionality in Free Logic.Hans-Peter Leeb - forthcoming - Journal of Philosophical Logic:1-19.
    If one takes seriously the idea that a scientific language must be extensional, and accepts Quine’s notion of truth-value-related extensionality, and also recognizes that a scientific language must allow for singular terms that do not refer to existing objects, then there is a problem, since this combination of assumptions must be inconsistent. I will argue for a particular solution to the problem, namely, changing what is meant by the word ‘extensionality’, so that it would not be the truth-value that had (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  41. Implicit and Explicit Stances in Logic.Johan Benthem - 2019 - Journal of Philosophical Logic 48 (3):571-601.
    We identify a pervasive contrast between implicit and explicit stances in logical analysis and system design. Implicit systems change received meanings of logical constants and sometimes also the notion of consequence, while explicit systems conservatively extend classical systems with new vocabulary. We illustrate the contrast for intuitionistic and epistemic logic, then take it further to information dynamics, default reasoning, and other areas, to show its wide scope. This gives a working understanding of the contrast, though we stop short of a (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  42. Definable Operators on Stable Set Lattices.Robert Goldblatt - forthcoming - Studia Logica:1-18.
    A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have a relational semantics provided by structures based on polarities. Such structures have associated complete lattices of stable subsets, and these have been used to construct canonical extensions of lattice-based algebras. We study classes of structures that are closed under ultraproducts and whose (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  43. The logic of ground.Adam Lovett - 2020 - Journal of Philosophical Logic 49 (1):13-49.
    I explore the logic of ground. I first develop a logic of weak ground. This logic strengthens the logic of weak ground presented by Fine in his ‘Guide to Ground.’ This logic, I argue, generates many plausible principles which Fine’s system leaves out. I then derive from this a logic of strict ground. I argue that there is a strong abductive case for adopting this logic. It’s elegant, parsimonious and explanatorily powerful. Yet, so I suggest, adopting it has important consequences. (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  44. Hyperlogic: A System for Talking About Logics.Alexander W. Kocurek - 2019 - Proceedings for the 22nd Amsterdam Colloquium.
    Sentences about logic are often used to show that certain embedding expressions, including attitude verbs, conditionals, and epistemic modals, are hyperintensional. Yet it not clear how to regiment “logic talk” in the object language so that it can be compositionally embedded under such expressions. This paper does two things. First, it argues against a standard account of logic talk, viz., the impossible worlds semantics. It is shown that this semantics does not easily extend to a language with propositional quantifiers, which (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  45. Reasoning Continuously: A Formal Construction of Continuous Proofs.T. D. P. Brunet & E. Fisher - forthcoming - Studia Logica:1-16.
    We begin with the idea that lines of reasoning are continuous mental processes and develop a notion of continuity in proof. This requires abstracting the notion of a proof as a set of sentences ordered by provability. We can then distinguish between discrete steps of a proof and possibly continuous stages, defining indexing functions to pick these out. Proof stages can be associated with the application of continuously variable rules, connecting continuity in lines of reasoning with continuously variable reasons. Some (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  46. A Lindström Theorem for Intuitionistic Propositional Logic.Guillermo Badia - 2020 - Notre Dame Journal of Formal Logic 61 (1):11-30.
    We show that propositional intuitionistic logic is the maximal abstract logic satisfying a certain form of compactness, the Tarski union property, and preservation under asimulations.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  47. Questions and Dependency in Intuitionistic Logic.Ivano Ciardelli, Rosalie Iemhoff & Fan Yang - 2020 - Notre Dame Journal of Formal Logic 61 (1):75-115.
    In recent years, the logic of questions and dependencies has been investigated in the closely related frameworks of inquisitive logic and dependence logic. These investigations have assumed classical logic as the background logic of statements, and added formulas expressing questions and dependencies to this classical core. In this paper, we broaden the scope of these investigations by studying questions and dependency in the context of intuitionistic logic. We propose an intuitionistic team semantics, where teams are embedded within intuitionistic Kripke models. (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  48. A Relevant Logic of Questions.Vít Punčochář - forthcoming - Journal of Philosophical Logic:1-35.
    This paper introduces the inquisitive extension of R, denoted as InqR, which is a relevant logic of questions based on the logic R as the background logic of declaratives. A semantics for InqR is developed, and it is shown that this semantics is, in a precisely defined sense, dual to Routley-Meyer semantics for R. Moreover, InqR is axiomatized and completeness of the axiomatic system is established. The philosophical interpretation of the duality between Routley-Meyer semantics and the semantics for InqR is (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  49. A Paraconsistent Conditional Logic.Minghui Ma & Chun-Ting Wong - forthcoming - Journal of Philosophical Logic:1-21.
    We develop a paraconsistent logic by introducing new models for conditionals with acceptive and rejective selection functions which are variants of Chellas’ conditional models. The acceptance and rejection conditions are substituted for truth conditions of conditionals. The paraconsistent conditional logic is axiomatized by a sequent system \ which is an extension of the Belnap-Dunn four-valued logic with a conditional operator. Some acceptive extensions of \ are shown to be sound and complete. We also show the finite acceptive model property and (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  50. Existentially Closed Brouwerian Semilattices.Luca Carai & Silvio Ghilardi - 2019 - Journal of Symbolic Logic 84 (4):1544-1575.
    The variety of Brouwerian semilattices is amalgamable and locally finite; hence, by well-known results [19], it has a model completion. In this article, we supply a finite and rather simple axiomatization of the model completion.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 6944