Results for 'Tableau calculi'

88 found
Order:
  1. A tableau calculus for partial functions.Manfred Kerber Michael Kohlhase - unknown
    Even though it is not very often admitted, partial functions do play a significant role in many practical applications of deduction systems. Kleene has already given a semantic account of partial functions using a three-valued logic decades ago, but there has not been a satisfactory mechanization. Recent years have seen a thorough investigation of the framework of many-valued truth-functional logics. However, strong Kleene logic, where quantification is restricted and therefore not truthfunctional, does not fit the framework directly. We solve this (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  2. Analytic Tableaux for all of SIXTEEN 3.Stefan Wintein & Reinhard Muskens - 2015 - Journal of Philosophical Logic 44 (5):473-487.
    In this paper we give an analytic tableau calculus P L 1 6 for a functionally complete extension of Shramko and Wansing’s logic. The calculus is based on signed formulas and a single set of tableau rules is involved in axiomatising each of the four entailment relations ⊧ t, ⊧ f, ⊧ i, and ⊧ under consideration—the differences only residing in initial assignments of signs to formulas. Proving that two sets of formulas are in one of the first (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  3. Non-Analytic Tableaux for Chellas's Conditional Logic CK and Lewis's Logic of Counterfactuals VC.Richard Zach - 2018 - Australasian Journal of Logic 15 (3):609-628.
    Priest has provided a simple tableau calculus for Chellas's conditional logic Ck. We provide rules which, when added to Priest's system, result in tableau calculi for Chellas's CK and Lewis's VC. Completeness of these tableaux, however, relies on the cut rule.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  4. Dual Systems of Sequents and Tableaux for Many-Valued Logics.Matthias Baaz, Christian G. Fermüller & Richard Zach - 1993 - Bulletin of the EATCS 51:192-197.
    The aim of this paper is to emphasize the fact that for all finitely-many-valued logics there is a completely systematic relation between sequent calculi and tableau systems. More importantly, we show that for both of these systems there are al- ways two dual proof sytems (not just only two ways to interpret the calculi). This phenomenon may easily escape one’s attention since in the classical (two-valued) case the two systems coincide. (In two-valued logic the assignment of a (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  5. Tableau-based decision procedure for the multiagent epistemic logic with all coalitional operators for common and distributed knowledge.M. Ajspur, V. Goranko & D. Shkatov - 2013 - Logic Journal of the IGPL 21 (3):407-437.
    We develop a conceptually clear, intuitive, and feasible decision procedure for testing satisfiability in the full multi\-agent epistemic logic \CMAELCD\ with operators for common and distributed knowledge for all coalitions of agents mentioned in the language. To that end, we introduce Hintikka structures for \CMAELCD\ and prove that satisfiability in such structures is equivalent to satisfiability in standard models. Using that result, we design an incremental tableau-building procedure that eventually constructs a satisfying Hintikka structure for every satisfiable input set (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  6. Tableau Software: Vizualizarea și analiza datelor.Nicolae Sfetcu - 2023 - It and C 2 (3):36-42.
    În prezent, datele sunt generate peste tot, precum YouTube, Tumblr, Reddit, Facebook, WhatsApp FacebookNS, Twitter, Instagram, Gmail, LinkedIn și Academia. Înțelegerea acestor date este foarte importantă, deoarece aceasta este o entitate crucială și foarte importantă a unei organizații, națiuni și instituții. Analiza și vizualizările seturilor de date pot oferi noi tendințe în afaceri, politică, sau intelligence, pot preveni bolile și pot modela pentru a prognoza paradigmele viitoare și a combate criminalitatea, și așa mai departe. În acest moment, cel mai utilizat (...)
    Download  
     
    Export citation  
     
    Bookmark  
  7. Labeled calculi and finite-valued logics.Matthias Baaz, Christian G. Fermüller, Gernot Salzer & Richard Zach - 1998 - Studia Logica 61 (1):7-33.
    A general class of labeled sequent calculi is investigated, and necessary and sufficient conditions are given for when such a calculus is sound and complete for a finite -valued logic if the labels are interpreted as sets of truth values. Furthermore, it is shown that any finite -valued logic can be given an axiomatization by such a labeled calculus using arbitrary "systems of signs," i.e., of sets of truth values, as labels. The number of labels needed is logarithmic in (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  8. The Basics of Display Calculi.Tim Lyon, Christian Ittner, Timo Eckhardt & Norbert Gratzl - 2017 - Kriterion - Journal of Philosophy 31 (2):55-100.
    The aim of this paper is to introduce and explain display calculi for a variety of logics. We provide a survey of key results concerning such calculi, though we focus mainly on the global cut elimination theorem. Propositional, first-order, and modal display calculi are considered and their properties detailed.
    Download  
     
    Export citation  
     
    Bookmark  
  9. Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics.Tim Lyon & Kees van Berkel - 2019 - In M. Baldoni, M. Dastani, B. Liao, Y. Sakurai & R. Zalila Wenkstern (eds.), PRIMA 2019: Principles and Practice of Multi-Agent Systems. Springer. pp. 202-218.
    This work provides proof-search algorithms and automated counter-model extraction for a class of STIT logics. With this, we answer an open problem concerning syntactic decision procedures and cut-free calculi for STIT logics. A new class of cut-free complete labelled sequent calculi G3LdmL^m_n, for multi-agent STIT with at most n-many choices, is introduced. We refine the calculi G3LdmL^m_n through the use of propagation rules and demonstrate the admissibility of their structural rules, resulting in auxiliary calculi Ldm^m_nL. In (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  10. On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems.Tim Lyon - 2013 - In Sergei Artemov & Anil Nerode (eds.), Logical Foundations of Computer Science (Lecture Notes in Computer Science 7734). Springer. pp. 177-194.
    This paper shows how to derive nested calculi from labelled calculi for propositional intuitionistic logic and first-order intuitionistic logic with constant domains, thus connecting the general results for labelled calculi with the more refined formalism of nested sequents. The extraction of nested calculi from labelled calculi obtains via considerations pertaining to the elimination of structural rules in labelled derivations. Each aspect of the extraction process is motivated and detailed, showing that each nested calculus inherits favorable (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  11. Cut-free Calculi and Relational Semantics for Temporal STIT Logics.Tim Lyon & Kees van Berkel - 2019 - In Francesco Calimeri, Nicola Leone & Marco Manna (eds.), Logics in Artificial Intelligence. Springer. pp. 803 - 819.
    We present cut-free labelled sequent calculi for a central formalism in logics of agency: STIT logics with temporal operators. These include sequent systems for Ldm , Tstit and Xstit. All calculi presented possess essential structural properties such as contraction- and cut-admissibility. The labelled calculi G3Ldm and G3Tstit are shown sound and complete relative to irreflexive temporal frames. Additionally, we extend current results by showing that also Xstit can be characterized through relational frames, omitting the use of BT+AC (...)
    Download  
     
    Export citation  
     
    Bookmark  
  12. A general tableau method for propositional interval temporal logics: Theory and implementation.V. Goranko, A. Montanari, P. Sala & G. Sciavicco - 2006 - Journal of Applied Logic 4 (3):305-330.
    In this paper we focus our attention on tableau methods for propositional interval temporal logics. These logics provide a natural framework for representing and reasoning about temporal properties in several areas of computer science. However, while various tableau methods have been developed for linear and branching time point-based temporal logics, not much work has been done on tableau methods for interval-based ones. We develop a general tableau method for Venema's \cdt\ logic interpreted over partial orders (\nsbcdt\ (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  13. An Analytic Tableau System for Natural Logic.Reinhard Muskens - 2010 - In Maria Aloni, H. Bastiaanse, T. De Jager & Katrin Schulz (eds.), Logic, Language, and Meaning: Selected Papers from the 17th Amsterdam Colloquium. Springer. pp. 104-113.
    Logic has its roots in the study of valid argument, but while traditional logicians worked with natural language directly, modern approaches first translate natural arguments into an artificial language. The reason for this step is that some artificial languages now have very well developed inferential systems. There is no doubt that this is a great advantage in general, but for the study of natural reasoning it is a drawback that the original linguistic forms get lost in translation. An alternative approach (...)
    Download  
     
    Export citation  
     
    Bookmark  
  14. On the Correspondence between Nested Calculi and Semantic Systems for Intuitionistic Logics.Tim Lyon - 2021 - Journal of Logic and Computation 31 (1):213-265.
    This paper studies the relationship between labelled and nested calculi for propositional intuitionistic logic, first-order intuitionistic logic with non-constant domains and first-order intuitionistic logic with constant domains. It is shown that Fitting’s nested calculi naturally arise from their corresponding labelled calculi—for each of the aforementioned logics—via the elimination of structural rules in labelled derivations. The translational correspondence between the two types of systems is leveraged to show that the nested calculi inherit proof-theoretic properties from their associated (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  15. A Road Map of Interval Temporal Logics and Duration Calculi.Valentin Goranko, Angelo Montanari & Guido Sciavicco - 2004 - Journal of Applied Non-Classical Logics 14 (1-2):9-54.
    We survey main developments, results, and open problems on interval temporal logics and duration calculi. We present various formal systems studied in the literature and discuss their distinctive features, emphasizing on expressiveness, axiomatic systems, and (un)decidability results.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  16. Beyond semantic pollution: Towards a practice-based philosophical analysis of labelled calculi.Fabio De Martin Polo - 2024 - Erkenntnis:1-30.
    This paper challenges the negative attitudes towards labelled proof systems, usually referred to as semantic pollution, by arguing that such critiques overlook the full potential of labelled calculi. The overarching objective is to develop a practice-based philosophical analysis of labelled calculi to provide insightful considerations regarding their proof-theoretic and philosophical value. To achieve this, successful applications of labelled calculi and related results will be showcased, and comparisons with other relevant works will be discussed. The paper ends by (...)
    Download  
     
    Export citation  
     
    Bookmark  
  17. Significance Tests, Belief Calculi, and Burden of Proof in Legal and Scientific Discourse.Julio Michael Stern - 2003 - Frontiers in Artificial Intelligence and Applications 101:139-147.
    We review the definition of the Full Bayesian Significance Test (FBST), and summarize its main statistical and epistemological characteristics. We review also the Abstract Belief Calculus (ABC) of Darwiche and Ginsberg, and use it to analyze the FBST’s value of evidence. This analysis helps us understand the FBST properties and interpretation. The definition of value of evidence against a sharp hypothesis, in the FBST setup, was motivated by applications of Bayesian statistical reasoning to legal matters where the sharp hypotheses were (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  18. Modular labelled calculi for relevant logics.Fabio De Martin Polo - 2023 - Australasian Journal of Logic 20 (1):47-87.
    In this article, we perform a detailed proof theoretic investigation of a wide number of relevant logics by employing the well-established methodology of labelled sequent calculi to build our intended systems. At the semantic level, we will characterise relevant logics by employing reduced Routley-Meyer models, namely, relational structures with a ternary relation between worlds along with a unique distinct element considered as the real (or actual) world. This paper realizes the idea of building a variety of modular labelled (...) by reflecting, at the syntactic level, semantic informations taken from reduced Routley-Meyer models. Central results include proofs of soundness and completeness, as well as a proof of cut- admissibility. (shrink)
    Download  
     
    Export citation  
     
    Bookmark  
  19. Commentary and Illocutionary Expressions in Linear Calculi of Natural Deduction.Moritz Cordes & Friedrich Reinmuth - 2017 - Logic and Logical Philosophy 26 (2).
    We argue that the need for commentary in commonly used linear calculi of natural deduction is connected to the “deletion” of illocutionary expressions that express the role of propositions as reasons, assumptions, or inferred propositions. We first analyze the formalization of an informal proof in some common calculi which do not formalize natural language illocutionary expressions, and show that in these calculi the formalizations of the example proof rely on commentary devices that have no counterpart in the (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  20. Translating Metainferences Into Formulae: Satisfaction Operators and Sequent Calculi.Ariel Jonathan Roffé & Federico Pailos - 2021 - Australasian Journal of Logic 3.
    In this paper, we present a way to translate the metainferences of a mixed metainferential system into formulae of an extended-language system, called its associated σ-system. To do this, the σ-system will contain new operators (one for each standard), called the σ operators, which represent the notions of "belonging to a (given) standard". We first prove, in a model-theoretic way, that these translations preserve (in)validity. That is, that a metainference is valid in the base system if and only if its (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  21. On the Curious Calculi of Wittgenstein and Spencer Brown.Gregory Landini - 2018 - Journal for the History of Analytical Philosophy 6 (10).
    In his Tractatus, Wittgenstein sets out what he calls his N-operator notation which can be used to calculate whether an expression is a tautology. In his Laws of Form, George Spencer Brown offers what he calls a “primary algebra” for such calculation. Both systems are perplexing. But comparing two blurry images can reduce noise, producing a focus. This paper reveals that Spencer Brown independently rediscovered the quantifier-free part of the N-operator calculus. The comparison sheds a flood light on each and (...)
    Download  
     
    Export citation  
     
    Bookmark  
  22. Approximating Propositional Calculi by Finite-valued Logics.Matthias Baaz & Richard Zach - 1994 - In Baaz Matthias & Zach Richard (eds.), 24th International Symposium on Multiple-valued Logic, 1994. Proceedings. IEEE Press. pp. 257–263.
    The problem of approximating a propositional calculus is to find many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few tautologies as possible. This has potential applications for representing (computationally complex) logics used in AI by (computationally easy) many-valued logics. It is investigated how far this method can be carried using (1) one or (2) an infinite sequence of many-valued logics. It is shown that the optimal candidate matrices for (1) can (...)
    Download  
     
    Export citation  
     
    Bookmark  
  23. On Minimal Models for Pure Calculi of Names.Piotr Kulicki - 2013 - Logic and Logical Philosophy 22 (4):429–443.
    By pure calculus of names we mean a quantifier-free theory, based on the classical propositional calculus, which defines predicates known from Aristotle’s syllogistic and Leśniewski’s Ontology. For a large fragment of the theory decision procedures, defined by a combination of simple syntactic operations and models in two-membered domains, can be used. We compare the system which employs `ε’ as the only specific term with the system enriched with functors of Syllogistic. In the former, we do not need an empty name (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  24. Stoic Syllogistic.Susanne Bobzien - 1996 - Oxford Studies in Ancient Philosophy 14:133-92.
    ABSTRACT: For the Stoics, a syllogism is a formally valid argument; the primary function of their syllogistic is to establish such formal validity. Stoic syllogistic is a system of formal logic that relies on two types of argumental rules: (i) 5 rules (the accounts of the indemonstrables) which determine whether any given argument is an indemonstrable argument, i.e. an elementary syllogism the validity of which is not in need of further demonstration; (ii) one unary and three binary argumental rules which (...)
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  25. Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents.Tim Lyon, Alwen Tiu, Rajeev Gore & Ranald Clouston - 2020 - In Maribel Fernandez & Anca Muscholl (eds.), 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). pp. 1-16.
    We provide a direct method for proving Craig interpolation for a range of modal and intuitionistic logics, including those containing a "converse" modality. We demonstrate this method for classical tense logic, its extensions with path axioms, and for bi-intuitionistic logic. These logics do not have straightforward formalisations in the traditional Gentzen-style sequent calculus, but have all been shown to have cut-free nested sequent calculi. The proof of the interpolation theorem uses these calculi and is purely syntactic, without resorting (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  26. Fusion, fission, and Ackermann’s truth constant in relevant logics: A proof-theoretic investigation.Fabio De Martin Polo - 2024 - In Andrew Tedder, Shawn Standefer & Igor Sedlar (eds.), New Directions in Relevant Logic. Springer.
    The aim of this paper is to provide a proof-theoretic characterization of relevant logics including fusion and fission connectives, as well as Ackermann’s truth constant. We achieve this by employing the well-established methodology of labelled sequent calculi. After having introduced several systems, we will conduct a detailed proof-theoretic analysis, show a cut-admissibility theorem, and establish soundness and completeness. The paper ends with a discussion that contextualizes our current work within the broader landscape of the proof theory of relevant logics.
    Download  
     
    Export citation  
     
    Bookmark  
  27. First-order belief and paraconsistency.Srećko Kovač - 2009 - Logic and Logical Philosophy 18 (2):127-143.
    A first-order logic of belief with identity is proposed, primarily to give an account of possible de re contradictory beliefs, which sometimes occur as consequences of de dicto non-contradictory beliefs. A model has two separate, though interconnected domains: the domain of objects and the domain of appearances. The satisfaction of atomic formulas is defined by a particular S-accessibility relation between worlds. Identity is non-classical, and is conceived as an equivalence relation having the classical identity relation as a subset. A (...) system with labels, signs, and suffixes is defined, extending the basic language $\mathscr{L}_{\mathbf{QB}}$ by quasiformulas (to express the denotations of predicates). The proposed logical system is paraconsistent since $\phi \wedge \neg\phi$ does not ``explode'' with arbitrary syntactic consequences. (shrink)
    Download  
     
    Export citation  
     
    Bookmark  
  28. New Logic and the Seeds of Analytic Philosophy.Kevin C. Klement - 2019 - In John Shand (ed.), A Companion to Nineteenth Century Philosophy (Blackwell Companions to Philosophy). Hoboken: Wiley-Blackwell. pp. 454–479.
    Analytic philosophy has been perhaps the most successful philosophical movement of the twentieth century. While there is no one doctrine that defines it, one of the most salient features of analytic philosophy is its reliance on contemporary logic, the logic that had its origin in the works of George Boole and Gottlob Frege and others in the mid‐to‐late nineteenth century. Boolean algebra, the heart of Boole's contributions to logic, has also come to represent a cornerstone of modern computing. Frege had (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  29. Tableaux-based decision method for single-agent linear time synchronous temporal epistemic logics with interacting time and knowledge.Mai Ajspur & Valentin Goranko - 2013 - In Kamal Lodaya (ed.), Logic and Its Applications. Springer. pp. 80--96.
    Temporal epistemic logics are known, from results of Halpern and Vardi, to have a wide range of complexities of the satisfiability problem: from PSPACE, through non-elementary, to highly undecidable. These complexities depend on the choice of some key parameters specifying, inter alia, possible interactions between time and knowledge, such as synchrony and agents' abilities for learning and recall. In this work we develop practically implementable tableau-based decision procedures for deciding satisfiability in single-agent synchronous temporal-epistemic logics with interactions between time (...)
    Download  
     
    Export citation  
     
    Bookmark  
  30. Epimorphism between Fine and Ferguson’s Matrices for Angell’s AC.Richard Zach - 2023 - Logic and Logical Philosophy 32 (2):161-179.
    Angell's logic of analytic containment AC has been shown to be characterized by a 9-valued matrix NC by Ferguson, and by a 16-valued matrix by Fine. We show that the former is the image of a surjective homomorphism from the latter, i.e., an epimorphic image. The epimorphism was found with the help of MUltlog, which also provides a tableau calculus for NC extended by quantifiers that generalize conjunction and disjunction.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  31. Theories of truth based on four-valued infectious logics.Damian Szmuc, Bruno Da Re & Federico Pailos - 2020 - Logic Journal of the IGPL 28 (5):712-746.
    Infectious logics are systems that have a truth-value that is assigned to a compound formula whenever it is assigned to one of its components. This paper studies four-valued infectious logics as the basis of transparent theories of truth. This take is motivated as a way to treat different pathological sentences differently, namely, by allowing some of them to be truth-value gluts and some others to be truth-value gaps and as a way to treat the semantic pathology suffered by at least (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  32.  49
    Inferential Quantification and the ω-Rule.Constantin C. Brîncuş - 2024 - In Antonio Piccolomini D'Aragona (ed.), Perspectives on Deduction: Contemporary Studies in the Philosophy, History and Formal Theories of Deduction. Springer Verlag. pp. 345-372.
    Logical inferentialism maintains that the formal rules of inference fix the meanings of the logical terms. The categoricity problem points out to the fact that the standard formalizations of classical logic do not uniquely determine the intended meanings of its logical terms, i.e., these formalizations are not categorical. This means that there are different interpretations of the logical terms that are consistent with the relation of logical derivability in a logical calculus. In the case of the quantificational logic, the categoricity (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  33. Proofnets for S5: sequents and circuits for modal logic.Greg Restall - 2007 - In C. Dimitracopoulos, L. Newelski & D. Normann (eds.), Logic Colloquium 2005: Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, Held in Athens, Greece, July 28-August 3, 2005. Cambridge: Cambridge University Press. pp. 151-172.
    In this paper I introduce a sequent system for the propositional modal logic S5. Derivations of valid sequents in the system are shown to correspond to proofs in a novel natural deduction system of circuit proofs (reminiscient of proofnets in linear logic, or multiple-conclusion calculi for classical logic). -/- The sequent derivations and proofnets are both simple extensions of sequents and proofnets for classical propositional logic, in which the new machinery—to take account of the modal vocabulary—is directly motivated in (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  34. The logic of partitions: Introduction to the dual of the logic of subsets: The logic of partitions.David Ellerman - 2010 - Review of Symbolic Logic 3 (2):287-350.
    Modern categorical logic as well as the Kripke and topological models of intuitionistic logic suggest that the interpretation of ordinary “propositional” logic should in general be the logic of subsets of a given universe set. Partitions on a set are dual to subsets of a set in the sense of the category-theoretic duality of epimorphisms and monomorphisms—which is reflected in the duality between quotient objects and subobjects throughout algebra. If “propositional” logic is thus seen as the logic of subsets of (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  35. Logics Based on Linear Orders of Contaminating Values.Roberto Ciuni, Thomas Macaulay Ferguson & Damian Szmuc - 2019 - Journal of Logic and Computation 29 (5):631–663.
    A wide family of many-valued logics—for instance, those based on the weak Kleene algebra—includes a non-classical truth-value that is ‘contaminating’ in the sense that whenever the value is assigned to a formula φ⁠, any complex formula in which φ appears is assigned that value as well. In such systems, the contaminating value enjoys a wide range of interpretations, suggesting scenarios in which more than one of these interpretations are called for. This calls for an evaluation of systems with multiple contaminating (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  36. Derivability and Metainferential Validity.Bruno Da Ré, Damian Szmuc & Paula Teijeiro - 2021 - Journal of Philosophical Logic 51 (6):1521-1547.
    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 _S__T_ and _T__S_. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  37. Inferential Quantification and the ω-rule.Constantin C. Brîncuş - 2024 - In Antonio Piccolomini D'Aragona (ed.), Perspectives on Deduction: Contemporary Studies in the Philosophy, History and Formal Theories of Deduction. Springer Verlag. pp. 345--372.
    Logical inferentialism maintains that the formal rules of inference fix the meanings of the logical terms. The categoricity problem points out to the fact that the standard formalizations of classical logic do not uniquely determine the intended meanings of its logical terms, i.e., these formalizations are not categorical. This means that there are different interpretations of the logical terms that are consistent with the relation of logical derivability in a logical calculus. In the case of the quantificational logic, the categoricity (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  38. Relevant Logics Obeying Component Homogeneity.Roberto Ciuni, Damian Szmuc & Thomas Macaulay Ferguson - 2018 - Australasian Journal of Logic 15 (2):301-361.
    This paper discusses three relevant logics that obey Component Homogeneity - a principle that Goddard and Routley introduce in their project of a logic of significance. The paper establishes two main results. First, it establishes a general characterization result for two families of logic that obey Component Homogeneity - that is, we provide a set of necessary and sufficient conditions for their consequence relations. From this, we derive characterization results for S*fde, dS*fde, crossS*fde. Second, the paper establishes complete sequent (...) for S*fde, dS*fde, crossS*fde. Among the other accomplishments of the paper, we generalize the semantics from Bochvar, Hallden, Deutsch and Daniels, we provide a general recipe to define containment logics, we explore the single-premise/single-conclusion fragment of S*fde, dS*fde, crossS*fdeand the connections between crossS*fde and the logic Eq of equality by Epstein. Also, we present S*fde as a relevant logic of meaninglessness that follows the main philosophical tenets of Goddard and Routley, and we briefly examine three further systems that are closely related to our main logics. Finally, we discuss Routley's criticism to containment logic in light of our results, and overview some open issues. (shrink)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  39. The Logic of Sequence Frames.Fabio Lampert - 2022 - Review of Symbolic Logic 15 (1):101-132.
    This paper investigates and develops generalizations of two-dimensional modal logics to any finite dimension. These logics are natural extensions of multidimensional systems known from the literature on logics for a priori knowledge. We prove a completeness theorem for propositional n-dimensional modal logics and show them to be decidable by means of a systematic tableau construction.
    Download  
     
    Export citation  
     
    Bookmark  
  40. An Epistemic Interpretation of Paraconsistent Weak Kleene Logic.Damian E. Szmuc - forthcoming - Logic and Logical Philosophy:1.
    This paper extends Fitting's epistemic interpretation of some Kleene logics, to also account for Paraconsistent Weak Kleene logic. To achieve this goal, a dualization of Fitting's "cut-down" operator is discussed, rendering a "track-down" operator later used to represent the idea that no consistent opinion can arise from a set including an inconsistent opinion. It is shown that, if some reasonable assumptions are made, the truth-functions of Paraconsistent Weak Kleene coincide with certain operations defined in this track-down fashion. Finally, further reflections (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  41. Boole's criteria for validity and invalidity.John Corcoran & Susan Wood - 1980 - Notre Dame Journal of Formal Logic 21 (4):609-638.
    It is one thing for a given proposition to follow or to not follow from a given set of propositions and it is quite another thing for it to be shown either that the given proposition follows or that it does not follow.* Using a formal deduction to show that a conclusion follows and using a countermodel to show that a conclusion does not follow are both traditional practices recognized by Aristotle and used down through the history of logic. These (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  42.  30
    Bien reçu? Trois éditions de Descartes au XIXe siècle en France.Delphine Antoine-Mahut - 2020 - Fabula 6551 (Accuser réception).
    Les études dites de réception se trouvent aujourd’hui dans une situation paradoxale. Au premier regard le tableau paraît souriant. Anciens ou modernes, les textes sont aujourd’hui communément abordés sous l’angle de leurs lectures immédiates (réception médiatique notamment) et, surtout, de leurs aménagements posthumes (avatars éditoriaux, propositions herméneutiques, usages sociaux). La multiplication de pareils travaux manifeste un engouement qui ne semble pas près de se démentir. Spectaculaire si l’on considère le nombre de thèses et de colloques qui entretiennent cette vague, (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  43. Modeling the interaction of computer errors by four-valued contaminating logics.Roberto Ciuni, Thomas Macaulay Ferguson & Damian Szmuc - 2019 - In Rosalie Iemhoff, Michael Moortgat & Ruy de Queiroz (eds.), Logic, Language, Information, and Computation. Folli Publications on Logic, Language and Information. pp. 119-139.
    Logics based on weak Kleene algebra (WKA) and related structures have been recently proposed as a tool for reasoning about flaws in computer programs. The key element of this proposal is the presence, in WKA and related structures, of a non-classical truth-value that is “contaminating” in the sense that whenever the value is assigned to a formula ϕ, any complex formula in which ϕ appears is assigned that value as well. Under such interpretations, the contaminating states represent occurrences of a (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  44. Reasons for Logic, Logic for Reasons: Pragmatics, Semantics, and Conceptual Roles.Ulf Hlobil & Robert Brandom - 2024 - New York: Routledge. Edited by Robert Brandom.
    This book presents a philosophical conception of logic -- "logical expressivism"-- according to which the role of logic is to make explicit reason relations, which are often neither monotonic nor transitive. It reveals new perspectives on inferential roles, sequent calculi, representation, truthmakers, and many extant logical theories.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  45. Stoic Sequent Logic and Proof Theory.Susanne Bobzien - 2019 - History and Philosophy of Logic 40 (3):234-265.
    This paper contends that Stoic logic (i.e. Stoic analysis) deserves more attention from contemporary logicians. It sets out how, compared with contemporary propositional calculi, Stoic analysis is closest to methods of backward proof search for Gentzen-inspired substructural sequent logics, as they have been developed in logic programming and structural proof theory, and produces its proof search calculus in tree form. It shows how multiple similarities to Gentzen sequent systems combine with intriguing dissimilarities that may enrich contemporary discussion. Much of (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  46.  91
    Not a difference of opinion: Wittgenstein and Turing on contradictions in mathematics.Wim Vanrie - 2024 - Philosophical Investigations 47 (4):584-602.
    In his 1939 Cambridge Lectures on the Foundations of Mathematics, Wittgenstein proclaims that he is not out to persuade anyone to change their opinions. I seek to further our understanding of this point by investigating an exchange between Wittgenstein and Turing on contradictions. In defending the claim that contradictory calculi are mathematically defective, Turing suggests that applying such a calculus would lead to disasters such as bridges falling down. In the ensuing discussion, it can seem as if Wittgenstein challenges (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  47. Epsilon theorems in intermediate logics.Matthias Baaz & Richard Zach - 2022 - Journal of Symbolic Logic 87 (2):682-720.
    Any intermediate propositional logic can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in Hilbert’s $\varepsilon $ -calculus. The first and second $\varepsilon $ -theorems for classical logic establish conservativity of the $\varepsilon $ -calculus over its classical base logic. It is well known that the second $\varepsilon $ -theorem fails for the intuitionistic $\varepsilon $ -calculus, as prenexation is impossible. The paper investigates the effect of adding critical $\varepsilon $ - (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  48. Logics of Formal Inconsistency Enriched with Replacement: An Algebraic and Modal Account.Walter Carnielli, Marcelo E. Coniglio & David Fuenmayor - 2022 - Review of Symbolic Logic 15 (3):771-806.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  49. A cut-free sequent calculus for the bi-intuitionistic logic 2Int.Sara Ayhan - manuscript
    The purpose of this paper is to introduce a bi-intuitionistic sequent calculus and to give proofs of admissibility for its structural rules. The calculus I will present, called SC2Int, is a sequent calculus for the bi-intuitionistic logic 2Int, which Wansing presents in [2016a]. There he also gives a natural deduction system for this logic, N2Int, to which SC2Int is equivalent in terms of what is derivable. What is important is that these calculi represent a kind of bilateralist reasoning, since (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  50. Refining Labelled Systems for Modal and Constructive Logics with Applications.Tim Lyon - 2021 - Dissertation, Technischen Universität Wien
    This thesis introduces the "method of structural refinement", which serves as a means of transforming the relational semantics of a modal and/or constructive logic into an 'economical' proof system by connecting two proof-theoretic paradigms: labelled and nested sequent calculi. The formalism of labelled sequents has been successful in that cut-free calculi in possession of desirable proof-theoretic properties can be automatically generated for large classes of logics. Despite these qualities, labelled systems make use of a complicated syntax that explicitly (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
1 — 50 / 88