A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Beyond weak normalization, we also prove the subformula property for full S5. ... We can mention many cut-free Gentzen systems for S4, S5 and K45/K45D, some normalizable natural deduction systems for intuitionistic modal logics and one more for full classical S4, but not for full classical ... A natural deduction system for full classical S5 The first-order language L for S5 is considered as usual. ...doi:10.1016/j.apal.2007.11.007 fatcat:5cvg24y4h5g5phv4so4pq35eqy
Weak normalization and subformula property is proved for full S5. ... We can mention cut-free Gentzen systems for S4/S5 [6, 7, 8, 1, 2, 16] , normalizable natural deduction systems for intuitionistic modal logics [12, 5] and for full classical S4 , but not for full classical ... A Natural Deduction System for Full S5 Modal Logic The first-order language L for S5 is considered as usual. ...doi:10.1016/j.entcs.2005.05.027 fatcat:qibe3mraczgmfcza5t7ef76iaq
Such notion is based on a construction that we call weak completions: a set of atoms M is an X-stable model of a theory T if M is a model of T, in the sense of classical logic, and the weak completion ... We prove that, for normal logic programs, the result obtained by these weak completions is invariant with respect to a large family of logics. ... Classical deductions for normal programs In this section, we briefly summarize some of our early work  , where a natural deduction system that can be used to prove atoms, with respect to classical ...doi:10.1093/logcom/exl013 fatcat:nlqsetzh55egrelp7thwzzumji
The suggested remedy is an extension of classical logic with a binary intensional operator (=>) and, in the first-order case, also with an existence predicate (A) and a quantifier over actual objects ( ... Logic Comput. 7 (1997), no. 6, 685-717; MR 98g:03049], we gave an approach, based on labelled natural deduction, for formalizing proof systems for a large class of propositional modal logics that includes ...
This article focuses on the technique of postponing the application of the reduction ad absurdum rule (raa) in classical natural deduction. ... First, it is shown how this technique is connected with two normalization strategies for classical logic: one given by Prawitz, and the other by Seldin. ... normalization for classical natural deduction. 2. ...arXiv:1710.08854v2 fatcat:larcs7ttwbdgdkezvkj5qzpbte
One of the selection criteria related to expressive strength is having an "enthymematic" conditional for which a deduction theorem holds. ... It is shown in this paper, however, that both E and R can be extended to explosive logics which satisfy all of Anderson and Belnap's selection criteria, provided the truth-constant known as the Ackermann ... Since AE interprets classical modal logic S4 and ♦A ⊃ ♦A is a theorem of AE5, it therefore follows that that AE5 interprets classical modal logic S5 under the natural translation. 15 There are further ...doi:10.1007/s11229-021-03065-z fatcat:ret4qhgklvhyblco7gdolyclne
The Logical Legacy of Nikolai Vasiliev and Modern Logic
Although this can be done with interesting consequences when starting from classical normal modal logics, some intriguing cases arise when starting from paraconsistent modalities and negations, as in the ... The paper also takes some first steps in exploring the philosophical significance of such logical tools, comparing them with the paraconsistent logics of the family of Logics of Formal Inconsistency (LFIs ... positive, had a weak (paraconsistent) negation, a classical negation could be defined by setting ∼α := α → (α ∧ (¬α ∧ α)). ...doi:10.1007/978-3-319-66162-9_15 fatcat:q2tjqfrc5bcgjnukbhf3ad22ou
Positive modal logic, AML, is the restriction of the minimal normal modal logic K with the local consequence relation to the modal language with the connectives A, V,0,0, T, 1. ... The author shows that the full models of PML are characterized as the models of G,,. A consequence of this is that G,, does not have a deduction-detachment theo- rem. J. M. ...
The skew Boolean propositional calculus (SBP C) is a generalization of the classical propositional calculus that arises naturally in the study of certain well-known deductive systems. ... In turn, this is equivalent to verifying four particular formulas are derivable from the candidate presentation. Automated deduction methods played a central role in proving these four theorems. ... It turns out that SBP C arises naturally in the study of non-classical deductive systems. ...doi:10.1007/s10817-006-9029-y fatcat:namf6tmvznfelio4r3ess4rd4q
In this paper, we introduce sound and complete deduction systems for the major modal dependence logics, especially those with intuitionistic connectives in their languages. ... We introduce in Section 2.1 Hilbert-style and natural deduction systems for the full logic MT 0 and MID. ... In this paper, we define Hilbert and natural deduction systems for modal dependence logic extended with intuitionistic disjunction and implication, called full modal downward closed team logic (MT 0 ). ...doi:10.1093/jigpal/jzx023 fatcat:vrbx3ay23zgfhcuxe4op2epj3y
Trends in Logic
The aim of this paper is to survey some work done recently or still in progress that applies generalized matrices (also called abstract logics by some) to the study of sentential logics. ... My main concern will be to emphasize the links between this line of research and other existing frameworks in Algebraic Logic, either well-established ones (such as the old theory of logical matrices and ... The two modal logics are the global and the local consequences associated with the class of Kripke models for the logic, S5 in this case; they are sometimes called the normal and the quasi-normal logics ...doi:10.1007/978-94-017-3598-8_4 fatcat:5ocrirz6zbhslhl3ktahhmmaoa
It begins with a brief review of semantics of common patterns of nonmonotonic deduction arising from a lack of knowledge, including autoepistemic deduction, in terms of the fixed-point equation φ(T,E)= ... In particular, the following minimalknowledge assumption MKA : ϕ∈MKA(T) iff ϕ does not add modally positive S5- consequences to T is used to syntactically characterize the operation CnAE by means of suitable ... PRESERVATION PROPERTIES In this section I interpret in modal language L K two classic theorems which turned out exceptionally useful in study of minimal model semantics of deductive data bases and logic ...doi:10.26348/znwwsi.6.74 doaj:c6340de35be34085b8bb73eec7d6a7e1 fatcat:li3oy2wacfgffklqj7cpniycpy
The full source code is available online and has been typechecked with Lean 3.4.1. ... This paper presents a recent formalization of a Henkin-style completeness proof for the propositional modal logic S5 using the Lean theorem prover. ... Acknowledgments Work supported in part by the AFOSR grant FA9550-18-1-0120. ...arXiv:1910.01697v1 fatcat:h7ogr2oxczfohfifdf4c7rz7qy
natural deduction system (with sentences as lines) as attributed to Aristotle by recent authors. ... Although reading certain reductions backward suggests a deduction system, the system thus suggested is a Gentzensequent natural deduction system (with arguments as lines) rather than a Jaskowski-supposition ... The addition of the natural generalization of Carnap's Mi-rule to the usual first-order deductive calculus gives a complete one for a-logics with denumerable a  . ...doi:10.2307/2274306 fatcat:kkksnqcog5g6zls66ku5abamd4
natural deduction system (with sentences as lines) as attributed to Aristotle by recent authors. ... Although reading certain reductions backward suggests a deduction system, the system thus suggested is a Gentzensequent natural deduction system (with arguments as lines) rather than a Jaskowski-supposition ... The addition of the natural generalization of Carnap's Mi-rule to the usual first-order deductive calculus gives a complete one for a-logics with denumerable a  . ...doi:10.2307/2273495 fatcat:qwtcwtawv5hnjhb3ut4wgqogwq
« Previous Showing results 1 — 15 out of 1,169 results