Results for 'Labelled calculus'

937 found
Order:
  1.  27
    A Labelled Deductive System for Relational Semantics of the Lambek Calculus.Miroslawa Kolowska-Gawiejnowicz - 1999 - Mathematical Logic Quarterly 45 (1):51-58.
    We present a labelled version of Lambek Calculus without unit, and we use it to prove a completeness theorem for Lambek Calculus with respect to some relational semantics.
    Direct download  
     
    Export citation  
     
    Bookmark  
  2. A tableau calculus with automaton-labelled formulae for regular grammar logics.Rajeev Gore - unknown
    We present a sound and complete tableau calculus for the class of regular grammar logics. Our tableau rules use a special feature called automaton-labelled formulae, which are similar to formulae of automaton propositional dynamic logic. Our calculus is cut-free and has the analytic superformula property so it gives a decision procedure. We show that the known EXPTIME upper bound for regular grammar logics can be obtained using our tableau calculus. We also give an effective Craig interpolation (...)
     
    Export citation  
     
    Bookmark   4 citations  
  3. From Display to Labelled Proofs for Tense Logics.Agata Ciabattoni, Tim Lyon & Revantha Ramanayake - 2013 - In Sergei Artemov & Anil Nerode (eds.), Logical Foundations of Computer Science (Lecture Notes in Computer Science 7734). Springer. pp. 120 - 139.
    We introduce an effective translation from proofs in the display calculus to proofs in the labelled calculus in the context of tense logics. We identify the labelled calculus proofs in the image of this translation as those built from labelled sequents whose underlying directed graph possesses certain properties. For the basic normal tense logic Kt, the image is shown to be the set of all proofs in the labelled calculus G3Kt.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  4.  11
    Labelled Deductive Systems for the Lambek Calculus.M. Kotowska-Gawiejnowicz - 1997 - Poznan Studies in the Philosophy of the Sciences and the Humanities 57:239-258.
  5.  56
    Herzberger’s Limit Rule with Labelled Sequent Calculus.Andreas Fjellstad - 2020 - Studia Logica 108 (4):815-855.
    Inspired by recent work on proof theory for modal logic, this paper develops a cut-free labelled sequent calculus obtained by imitating Herzberger’s limit rule for revision sequences as a clause in a possible world semantics. With the help of two completeness theorems, one between the labelled sequent calculus and the corresponding possible world semantics, and one between the axiomatic theory of truth PosFS and a neighbourhood semantics, together with the proof of the equivalence between the two (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6. 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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  7.  34
    A Mixed λ-calculus.Marie-Renée Fleury & Myriam Quatrini - 2007 - Studia Logica 87 (2-3):269-294.
    The aim of this paper is to define a λ-calculus typed in aMixed (commutative and non-commutative) Intuitionistic Linear Logic. The terms of such a calculus are the labelling of proofs of a linear intuitionistic mixed natural deduction NILL, which is based on the non-commutative linear multiplicative sequent calculus MNL [RuetAbrusci 99]. This linear λ-calculus involves three linear arrows: two directional arrows and a nondirectional one (the usual linear arrow). Moreover, the -terms are provided with seriesparallel orders (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  8.  18
    Powerset residuated algebras and generalized Lambek calculus.Miroslawa Kolowska-Gawiejnowicz - 1997 - Mathematical Logic Quarterly 43 (1):60-72.
    We prove a representation theorem for residuated algebras: each residuated algebra is isomorphically embeddable into a powerset residuated algebra. As a consequence, we obtain a completeness theorem for the Generalized Lambek Calculus. We use a Labelled Deductive System which generalizes the one used by Buszkowski [4] and Pankrat'ev [17] in completeness theorems for the Lambek Calculus.
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  9.  42
    Propositional quantifiers in labelled natural deduction for normal modal logic.Matteo Pascucci - 2019 - Logic Journal of the IGPL 27 (6):865-894.
    This article concerns the treatment of propositional quantification in a framework of labelled natural deduction for modal logic developed by Basin, Matthews and Viganò. We provide a detailed analysis of a basic calculus that can be used for a proof-theoretic rendering of minimal normal multimodal systems with quantification over stable domains of propositions. Furthermore, we consider variations of the basic calculus obtained via relational theories and domain theories allowing for quantification over possibly unstable domains of propositions. The (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  10.  17
    A reduction-based cut-free Gentzen calculus for dynamic epistemic logic1.Martin Wirsing & Alexander Knapp - 2023 - Logic Journal of the IGPL 31 (6):1047-1068.
    Dynamic epistemic logic (DEL) is a multi-modal logic for reasoning about the change of knowledge in multi-agent systems. It extends epistemic logic by a modal operator for actions which announce logical formulas to other agents. In Hilbert-style proof calculi for DEL, modal action formulas are reduced to epistemic logic, whereas current sequent calculi for DEL are labelled systems which internalize the semantic accessibility relation of the modal operators, as well as the accessibility relation underlying the semantics of the actions. (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  11.  55
    Conditional beliefs: From neighbourhood semantics to sequent calculus.Marianna Girlando, Sara Negri, Nicola Olivetti & Vincent Risch - 2018 - Review of Symbolic Logic 11 (4):736-779.
    The logic of Conditional Beliefs has been introduced by Board, Baltag, and Smets to reason about knowledge and revisable beliefs in a multi-agent setting. In this article both the semantics and the proof theory for this logic are studied. First, a natural semantics forCDLis defined in terms of neighbourhood models, a multi-agent generalisation of Lewis’ spheres models, and it is shown that the axiomatization ofCDLis sound and complete with respect to this semantics. Second, it is shown that the neighbourhood semantics (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  12.  48
    The monadic hybrid calculus.Omar Alaqeeli & William Wadge - 2017 - Journal of Applied Non-Classical Logics 27 (1-2):33-49.
    We present the design goals and metatheory of the Monadic Hybrid Calculus, a new formal system that has the same power as the Monadic Predicate Calculus. MHC allows quantification, including relative quantification, in a straightforward way without the use of bound variables, using a simple adaptation of modal logic notation. Thus “all Greeks are mortal” can be written as [G]M. MHC is also ‘hybrid’ in that it has individual constants, which allow us to formulate statements about particular individuals. (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  13.  15
    A Normalization Procedure For The Equational Fragment Of Labelled Natural Deduction.A. de Oliveira & R. B. de Queiroz - 1999 - Logic Journal of the IGPL 7 (2):173-215.
    The notion of normal proof theory, and yet it has been somewhat neglected by the systems of equational logic. The intention here is then to show the normalization procedure for the equational logic of the Labelled Natural Deduction system . With this we believe we are making a step towards filling a gap in the literature on equational logic. Besides presenting a normalization procedure for the LND equational fragment, we employ a new method to prove the normalization theorems for (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  14.  64
    Theorem proving for conditional logics: CondLean and GOALD U CK.Nicola Olivetti & Gian Luca Pozzato - 2008 - Journal of Applied Non-Classical Logics 18 (4):427-473.
    In this paper we focus on theorem proving for conditional logics. First, we give a detailed description of CondLean, a theorem prover for some standard conditional logics. CondLean is a SICStus Prolog implementation of some labeled sequent calculi for conditional logics recently introduced. It is inspired to the so called “lean” methodology, even if it does not fit this style in a rigorous manner. CondLean also comprises a graphical interface written in Java. Furthermore, we introduce a goal-directed proof search mechanism, (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  15. 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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  16.  60
    (1 other version)Proof Compression and NP Versus PSPACE.L. Gordeev & E. H. Haeusler - 2019 - Studia Logica 107 (1):53-83.
    We show that arbitrary tautologies of Johansson’s minimal propositional logic are provable by “small” polynomial-size dag-like natural deductions in Prawitz’s system for minimal propositional logic. These “small” deductions arise from standard “large” tree-like inputs by horizontal dag-like compression that is obtained by merging distinct nodes labeled with identical formulas occurring in horizontal sections of deductions involved. The underlying geometric idea: if the height, h(∂), and the total number of distinct formulas, ϕ(∂), of a given tree-like deduction ∂ of a minimal (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  17.  57
    A More Unified Approach to Free Logics.Edi Pavlović & Norbert Gratzl - 2020 - Journal of Philosophical Logic 50 (1):117-148.
    Free logics is a family of first-order logics which came about as a result of examining the existence assumptions of classical logic. What those assumptions are varies, but the central ones are that the domain of interpretation is not empty, every name denotes exactly one object in the domain and the quantifiers have existential import. Free logics usually reject the claim that names need to denote in, and of the systems considered in this paper, the positive free logic concedes that (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  18.  54
    Some results on Jaśkowski’s discursive logic.Lafayette De Moraes & Jair Minoro Abe - 2001 - Logic and Logical Philosophy 9:25.
    Jaśkowski [3] presented a new propositional calculus labeled “discussive propositional calculus”, to serve as an underlying basis for inconsistent but non-trivial theories. This system was later extended to lower andhigher order predicate calculus . Jaśkowski’s system of discussiveor discursive propositional calculus can actually be extended to predicatecalculus in at least two ways. We have the intention using this calculus ofbuilding later as a basis for a discussive theory of sets. One way is thatstudied by Da (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  19. Display to Labeled Proofs and Back Again for Tense Logics.Agata Ciabattoni, Tim Lyon, Revantha Ramanayake & Alwen Tiu - 2021 - ACM Transactions on Computational Logic 22 (3):1-31.
    We introduce translations between display calculus proofs and labeled calculus proofs in the context of tense logics. First, we show that every derivation in the display calculus for the minimal tense logic Kt extended with general path axioms can be effectively transformed into a derivation in the corresponding labeled calculus. Concerning the converse translation, we show that for Kt extended with path axioms, every derivation in the corresponding labeled calculus can be put into a special (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  20.  59
    On semilattice relevant logics.Ryo Kashima - 2003 - Mathematical Logic Quarterly 49 (4):401.
    The semilattice relevant logics ∪R, ∪T, ∪RW, and ∪TW are defined by semilattice models in which conjunction and disjunction are interpreted in a natural way. For each of them, there is a cut-free labelled sequent calculus with plural succedents . We prove that these systems are equivalent, with respect to provable formulas, to the restricted systems with single succedents . Moreover, using this equivalence, we give a new Hilbert-style axiomatizations for ∪R and ∪T and prove equivalence between two (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  21. Representing events and discourse: Comments on Hamm, Kamp and Van lambalgen.Tim Fernando - manuscript
    In [HKL00] (henceforth HKL), Hamm, Kamp and van Lambalgen declare ‘‘there is no opposition between formal and cognitive semantics,’’ notwithstanding the realist/mentalist divide. That divide separates two sides Jackendo¤ has (in [Jac96], following Chomsky) labeled E(xternalized)-semantics, relating language to a reality independent of speakers, and I(nternalized)-semantics, revolving around mental representations and thought. Although formal semanticists have (following David Lewis) traditionally leaned towards E-semantics, it is reasonable to apply formal methods also to I-semantics. This point is made clear in HKL via (...)
     
    Export citation  
     
    Bookmark   1 citation  
  22. Nested Sequents for Intuitionistic Modal Logics via Structural Refinement.Tim Lyon - 2021 - In Anupam Das & Sara Negri (eds.), Automated Reasoning with Analytic Tableaux and Related Methods: TABLEAUX 2021. pp. 409-427.
    We employ a recently developed methodology -- called "structural refinement" -- to extract nested sequent systems for a sizable class of intuitionistic modal logics from their respective labelled sequent systems. This method can be seen as a means by which labelled sequent systems can be transformed into nested sequent systems through the introduction of propagation rules and the elimination of structural rules, followed by a notational translation. The nested systems we obtain incorporate propagation rules that are parameterized with (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  23.  51
    Positive provability logic for uniform reflection principles.Lev Beklemishev - 2014 - Annals of Pure and Applied Logic 165 (1):82-105.
    We deal with the fragment of modal logic consisting of implications of formulas built up from the variables and the constant ‘true’ by conjunction and diamonds only. The weaker language allows one to interpret the diamonds as the uniform reflection schemata in arithmetic, possibly of unrestricted logical complexity. We formulate an arithmetically complete calculus with modalities labeled by natural numbers and ω, where ω corresponds to the full uniform reflection schema, whereas n<ω corresponds to its restriction to arithmetical Πn+1-formulas. (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  24. Reasoning About Collectively Accepted Group Beliefs.Raul Hakli & Sara Negri - 2011 - Journal of Philosophical Logic 40 (4):531-555.
    A proof-theoretical treatment of collectively accepted group beliefs is presented through a multi-agent sequent system for an axiomatization of the logic of acceptance. The system is based on a labelled sequent calculus for propositional multi-agent epistemic logic with labels that correspond to possible worlds and a notation for internalized accessibility relations between worlds. The system is contraction- and cut-free. Extensions of the basic system are considered, in particular with rules that allow the possibility of operative members or legislators. (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  25. Proof theory of epistemic logic of programs.Paolo Maffezioli & Alberto Naibo - 2014 - Logic and Logical Philosophy 23 (3):301--328.
    A combination of epistemic logic and dynamic logic of programs is presented. Although rich enough to formalize some simple game-theoretic scenarios, its axiomatization is problematic as it leads to the paradoxical conclusion that agents are omniscient. A cut-free labelled Gentzen-style proof system is then introduced where knowledge and action, as well as their combinations, are formulated as rules of inference, rather than axioms. This provides a logical framework for reasoning about games in a modular and systematic way, and to (...)
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  26.  8
    A Proof-Theoretic Approach to Formal Epistemology.Sara Negri & Edi Pavlović - 2024 - In Yale Weiss & Romina Birman (eds.), Saul Kripke on Modal Logic. Cham: Springer. pp. 303-345.
    Ever since antiquity, attempts have been made at defining knowledge through belief augmented by additional properties such as truth and justification. These characterizations have been challenged by Gettier counterexamples and their variants. A modern proposal, what is known as defeasibility theory, characterizes knowledge through stability under revision of beliefs on the basis of true or arbitrary information. A formal investigation of such a proposal calls for the methods of dynamic epistemic logic: well developed semantic approaches to dynamic epistemic logic have (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  27. Proof analysis in intermediate logics.Roy Dyckhoff & Sara Negri - 2012 - Archive for Mathematical Logic 51 (1):71-92.
    Using labelled formulae, a cut-free sequent calculus for intuitionistic propositional logic is presented, together with an easy cut-admissibility proof; both extend to cover, in a uniform fashion, all intermediate logics characterised by frames satisfying conditions expressible by one or more geometric implications. Each of these logics is embedded by the Gödel–McKinsey–Tarski translation into an extension of S4. Faithfulness of the embedding is proved in a simple and general way by constructive proof-theoretic methods, without appeal to semantics other than (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   32 citations  
  28. The Church–Fitch knowability paradox in the light of structural proof theory.Paolo Maffezioli, Alberto Naibo & Sara Negri - 2012 - Synthese 190 (14):2677-2716.
    Anti-realist epistemic conceptions of truth imply what is called the knowability principle: All truths are possibly known. The principle can be formalized in a bimodal propositional logic, with an alethic modality ${\diamondsuit}$ and an epistemic modality ${\mathcal{K}}$, by the axiom scheme ${A \supset \diamondsuit \mathcal{K} A}$. The use of classical logic and minimal assumptions about the two modalities lead to the paradoxical conclusion that all truths are known, ${A \supset \mathcal{K} A}$. A Gentzen-style reconstruction of the Church–Fitch paradox is presented (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  29. 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 (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   19 citations  
  30. (1 other version)On the da Costa, Dubikajtis and Kotas' system of the discursive logic, D* 2.Janusz Ciuciura - 2005 - Logic and Logical Philosophy 14 (2):235-252.
    In the late forties, Stanisław Jaśkowski published two papers onthe discursive sentential calculus, D2. He provided a definition of it by an interpretation in the language of S5 of Lewis. The knownaxiomatization of D2 with discursive connectives as primitives was introduced by da Costa, Dubikajtis and Kotas in 1977. It turns out, however,that one of the axioms they used is not a thesis of the real Jaśkowski’s calculus. In fact, they built a new system, D∗2 for short, that (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  31.  94
    Semantic pollution and syntactic purity.Stephen Read - 2015 - Review of Symbolic Logic 8 (4):649-661.
    Logical inferentialism claims that the meaning of the logical constants should be given, not model-theoretically, but by the rules of inference of a suitable calculus. It has been claimed that certain proof-theoretical systems, most particularly, labelled deductive systems for modal logic, are unsuitable, on the grounds that they are semantically polluted and suffer from an untoward intrusion of semantics into syntax. The charge is shown to be mistaken. It is argued on inferentialist grounds that labelled deductive systems (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  32.  38
    Super-Strict Implications.Guido Gherardi & Eugenio Orlandelli - 2021 - Bulletin of the Section of Logic 50 (1):1-34.
    This paper introduces the logics of super-strict implications, where a super-strict implication is a strengthening of C.I. Lewis' strict implication that avoids not only the paradoxes of material implication but also those of strict implication. The semantics of super-strict implications is obtained by strengthening the (normal) relational semantics for strict implication. We consider all logics of super-strict implications that are based on relational frames for modal logics in the modal cube. it is shown that all logics of super-strict implications are (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  33.  35
    The Functional Interpretation of the Existential Quantifier.Ruy B. de Queiroz & Dov Gabbay - 1995 - Logic Journal of the IGPL 3 (2-3):243-290.
    We are concerned with showing how ‘labelled’ Natural Deduction presentation systems based on an extension of the so-called Curry-Howard functional interpretation can help us understand and generalise most of the deduction calculi designed to deal with the logical notion of existential quantification. We present the labelling mechanism for ‘’ using what we call ‘ɛ-terms’, which have the form of ‘a’) in a dual form to the ‘Ax.f’ terms of in the sense that the ‘witness’ is chosen at the time (...)
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  34.  26
    The Foundations of Newton's Philosophy of Nature.Richard S. Westfall - 1962 - British Journal for the History of Science 1 (2):171-182.
    Taking Isaac Newton at his own word, historians have long agreed that the decade of the 1660s, when Newton was a young man in his twenties, was the critical period in his scientific career. In the years 1665 and 1666, he has told us, he hit on the ideas of cosmic gravitation, the composition of white light, and the fluxional calculus. The elaboration of these basic ideas constituted his scientific achievement. Nevertheless, the decade of the 1660s has remained a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  35. Wittgenstein's philosophies of mathematics.Steve Gerrard - 1991 - Synthese 87 (1):125-142.
    Wittgenstein's philosophy of mathematics has long been notorious. Part of the problem is that it has not been recognized that Wittgenstein, in fact, had two chief post-Tractatus conceptions of mathematics. I have labelled these the calculus conception and the language-game conception. The calculus conception forms a distinct middle period. The goal of my article is to provide a new framework for examining Wittgenstein's philosophies of mathematics and the evolution of his career as a whole. I posit the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  36.  36
    A Pure View of Ecumenical Modalities.Sonia Marin, Luiz Carlos Pereira, Elaine Pimentel & Emerson Sales - 2021 - In Alexandra Silva, Renata Wassermann & Ruy de Queiroz (eds.), Logic, Language, Information, and Computation: 27th International Workshop, Wollic 2021, Virtual Event, October 5–8, 2021, Proceedings. Springer Verlag. pp. 388-407.
    Recent works about ecumenical systems, where connectives from classical and intuitionistic logics can co-exist in peace, warmed the discussion on proof systems for combining logics. This discussion has been extended to alethic modalities using Simpson’s meta-logical characterization: necessity is independent of the viewer, while possibility can be either intuitionistic or classical. In this work, we propose a pure, label free calculus for ecumenical modalities, nEK\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {nEK}$$\end{document}, where exactly one logical operator (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  37.  36
    Expressing logical disagreement from within.Andreas Fjellstad - 2022 - Synthese 200 (2):1-33.
    Against the backdrop of the frequent comparison of theories of truth in the literature on semantic paradoxes with regard to which inferences and metainferences are deemed valid, this paper develops a novel approach to defining a binary predicate for representing the valid inferences and metainferences of a theory within the theory itself under the assumption that the theory is defined with a classical meta-theory. The aim with the approach is to obtain a tool which facilitates the comparison between a theory (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  38.  9
    Ontology and the Logistic Analysis of Language: An Enquiry into the Contemporary Views on Universals.Guido Küng - 2013 - Dordrecht, Netherland: Springer.
    It is the aim of the present study to introduce the reader to the ways of thinking of those contemporary philosophers who apply the tools of symbolic logic to classical philosophical problems. Unlike the "conti nental" reader for whom this work was originally written, the English speaking reader will be more familiar with most of the philosophers dis cussed in this book, and he will in general not be tempted to dismiss them indiscriminately as "positivists" and "nominalists". But the English (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  39.  37
    Recapturing Dynamic Logic of Relation Changers via Bounded Morphisms.Ryo Hatano & Katsuhiko Sano - 2020 - Studia Logica 109 (1):95-124.
    The present contribution shows that a Hilbert-style axiomatization for dynamic logic of relation changers is complete for the standard Kripke semantics not by a well-known rewriting technique but by the idea of an auxiliary semantics studied by van Benthem and Wang et al. A key insight of our auxiliary semantics for dynamic logic of relation changers can be described as: “relation changers are bounded morphisms.” Moreover, we demonstrate that this semantic insight can be used to provide a modular cut-free (...) sequent calculus for the logic in the sense that our calculus can be regarded as a natural expansion of a labelled sequent calculus of iteration-free propositional dynamic logic. (shrink)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40.  45
    Euphony and Logos: Essays in Honour of Maria Steffen-Batóg and Tadeusz Batóg.Roman Murawski & Jerzy Pogonowski (eds.) - 1997 - Rodopi.
    Contents: Preface. SCIENTIFIC WORKS OF MARIA STEFFEN-BATÓG AND TADEUSZ BATÓG. List of Publications of Maria Steffen-Batóg. List of Publications of Tadeusz Batóg. Jerzy POGONOWSKI: On the Scientific Works of Maria Steffen-Batóg. Jerzy POGONOWSKI: On the Scientific Works of Tadeusz Batóg. W??l??odzimierz LAPIS: How Should Sounds Be Phonemicized? Pawe??l?? NOWAKOWSKI: On Applications of Algorithms for Phonetic Transcription in Linguistic Research. Jerzy POGONOWSKI: Tadeusz Batóg's Phonological Systems. MATHEMATICAL LOGIC. Wojciech BUSZKOWSKI: Incomplete Information Systems and Kleene 3-valued Logic. Maciej KANDULSKI: Categorial Grammars with (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  41.  56
    Natural Deduction Systems for Intuitionistic Logic with Identity.Szymon Chlebowski, Marta Gawek & Agata Tomczyk - 2022 - Studia Logica 110 (6):1381-1415.
    The aim of the paper is to present two natural deduction systems for Intuitionistic Sentential Calculus with Identity ( ISCI ); a syntactically motivated \(\mathsf {ND}^1_{\mathsf {ISCI}}\) and a semantically motivated \(\mathsf {ND}^2_{\mathsf {ISCI}}\). The formulation of \(\mathsf {ND}^1_{\mathsf {ISCI}}\) is based on the axiomatic formulation of ISCI. Its rules cannot be straightforwardly classified as introduction or elimination rules; ISCI -specific rules are based on axioms characterizing the identity connective. The system does not enjoy the standard subformula property, but (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  42.  63
    Natural Deduction Calculi and Sequent Calculi for Counterfactual Logics.Francesca Poggiolesi - 2016 - Studia Logica 104 (5):1003-1036.
    In this paper we present labelled sequent calculi and labelled natural deduction calculi for the counterfactual logics CK + {ID, MP}. As for the sequent calculi we prove, in a semantic manner, that the cut-rule is admissible. As for the natural deduction calculi we prove, in a purely syntactic way, the normalization theorem. Finally, we demonstrate that both calculi are sound and complete with respect to Nute semantics [12] and that the natural deduction calculi can be effectively transformed (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  43. Countable additivity and the de finetti lottery.Paul Bartha - 2004 - British Journal for the Philosophy of Science 55 (2):301-321.
    De Finetti would claim that we can make sense of a draw in which each positive integer has equal probability of winning. This requires a uniform probability distribution over the natural numbers, violating countable additivity. Countable additivity thus appears not to be a fundamental constraint on subjective probability. It does, however, seem mandated by Dutch Book arguments similar to those that support the other axioms of the probability calculus as compulsory for subjective interpretations. These two lines of reasoning can (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  44.  39
    Omega-inconsistency without cuts and nonstandard models.Andreas Fjellstad - 2016 - Australasian Journal of Logic 13 (5).
    This paper concerns the relationship between transitivity of entailment, omega-inconsistency and nonstandard models of arithmetic. First, it provides a cut-free sequent calculus for non-transitive logic of truth STT based on Robinson Arithmetic and shows that this logic is omega-inconsistent. It then identifies the conditions in McGee for an omega-inconsistent logic as quantified standard deontic logic, presents a cut-free labelled sequent calculus for quantified standard deontic logic based on Robinson Arithmetic where the deontic modality is treated as a (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  45.  7
    Gentzen and Temporal Sequents.Andrzej Indrzejczak - 2024 - Studies in Logic, Grammar and Rhetoric 69 (1):241-258.
    The paper presents a comparison of two generalised sequent calculi for temporal logics. In both cases the main technical solution is the multiplication of the sorts of sequents and, additionally, the application of some kind of labelling to formulae. The first approach was proposed by Kaziemierz Trzęsicki at the 1980s. The second, called Multiple Sequent Calculus (MSC), was proposed in the beginning of the present century. Both approaches are examples of the family of multisequent calculi.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  46.  14
    Styles of Discourse.Ioannis Vandoulakis & Tatiana Denisova (eds.) - 2021 - Kraków: Instytut Filozofii, Uniwersytet Jagielloński w Krakowie.
    The volume starts with the paper of Lynn Maurice Ferguson Arnold, former Premier of South Australia and former Minister of Education of Australia, concerning the Exposition Internationale des Arts et Techniques dans la Vie Moderne (International Exposition of Art and Technology in Modern Life) that was held from 25 May to 25 November 1937 in Paris, France. The organization of the world exhibition had placed the Nazi German and the Soviet pavilions directly across from each other. Many papers are devoted (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  47.  39
    On the Proof Theory of Infinitary Modal Logic.Matteo Tesi - 2022 - Studia Logica 110 (6):1349-1380.
    The article deals with infinitary modal logic. We first discuss the difficulties related to the development of a satisfactory proof theory and then we show how to overcome these problems by introducing a labelled sequent calculus which is sound and complete with respect to Kripke semantics. We establish the structural properties of the system, namely admissibility of the structural rules and of the cut rule. Finally, we show how to embed common knowledge in the infinitary calculus and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  48. Proof Theory for Modal Logic.Sara Negri - 2011 - Philosophy Compass 6 (8):523-538.
    The axiomatic presentation of modal systems and the standard formulations of natural deduction and sequent calculus for modal logic are reviewed, together with the difficulties that emerge with these approaches. Generalizations of standard proof systems are then presented. These include, among others, display calculi, hypersequents, and labelled systems, with the latter surveyed from a closer perspective.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  49.  12
    A bridge to higher mathematics.James R. Kirkwood - 2024 - Boca Raton, FL: CRC Press. Edited by Raina S. Robeva.
    The goal of this unique text is to provide an "experience" that would facilitate a better transition for mathematics majors to the advanced proof-based courses required for their major. If you "love mathematics, but I hate proofs" this book is for you. Example-based courses such as introductory Calculus transition somewhat abruptly, and without a warning label, to proof-based courses, and may leave students with the unpleasant feeling that a subject they loved has turned into material they find hard to (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  50.  91
    Breve storia dell'etica.Sergio Cremaschi - 2012 - Roma RM, Italia: Carocci.
    The book reconstructs the history of Western ethics. The approach chosen focuses the endless dialectic of moral codes, or different kinds of ethos, moral doctrines that are preached in order to bring about a reform of existing ethos, and ethical theories that have taken shape in the context of controversies about the ethos and moral doctrines as means of justifying or reforming moral doctrines. Such dialectic is what is meant here by the phrase ‘moral traditions’, taken as a name for (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
1 — 50 / 937