Results 11 to 20 of about 5,094 (281)
Fractional-Valued Modal Logic and Soft Bilateralism [PDF]
Bulletin of the Section of Logic, 2023 In a recent paper, under the auspices of an unorthodox variety of bilateralism, we introduced a new kind of proof-theoretic semantics for the base modal logic \(\mathbf{K}\), whose values lie in the closed interval \([0,1]\) of rational numbers [14].
Mario Piazza +2 more
doaj +2 more sources
Labelled Tableaux for Non-Normal Modal Logics [PDF]
, 2000 In this paper we show how to extend KEM, a tableau-like proof system for normal modal logic, in order to deal with classes of non-normal modal logics, such as monotonic and regular, in a uniform and modular way.
Guido Governatori, Alessandro Luppi
core +7 more sources
Theorem Provers For Every Normal Modal Logic
EPiC Series in Computing, 2018 We present a procedure for algorithmically embedding problems formulated in higher- order modal logic into classical higher-order logic. The procedure was implemented as a stand-alone tool and can be used as a preprocessor for turning TPTP THF-compliant the- orem provers into provers for various modal logics.
Tobias Gleißner +2 more
openaire +4 more sources
On Nested Sequents for Constructive Modal Logics [PDF]
Logical Methods in Computer Science, 2015 We present deductive systems for various modal logics that can be obtained from the constructive variant of the normal modal logic CK by adding combinations of the axioms d, t, b, 4, and 5.
Lutz Strassburger +2 more
doaj +1 more source
Generic Modal Cut Elimination Applied to Conditional Logics [PDF]
Logical Methods in Computer Science, 2011 We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies also to a wide
Dirk Pattinson, Lutz Schröder
doaj +1 more source
Neighbourhood Structures: Bisimilarity and Basic Model Theory [PDF]
Logical Methods in Computer Science, 2009 Neighbourhood structures are the standard semantic tool used to reason about non-normal modal logics. The logic of all neighbourhood models is called classical modal logic.
Helle Hvid Hansen +2 more
doaj +1 more source
A Type-Directed Negation Elimination [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 In the modal mu-calculus, a formula is well-formed if each recursive variable occurs underneath an even number of negations. By means of De Morgan's laws, it is easy to transform any well-formed formula into an equivalent formula without negations ...
Etienne Lozes
doaj +1 more source
Bulletin of the Section of Logic, 2021 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.
Guido Gherardi, Eugenio Orlandelli
doaj +1 more source
Free Choice in Modal Inquisitive Logic
, 2023 This paper investigates inquisitive extensions of normal modal logic with an existential modal operator taken as primitive. The semantics of the existential modality is generalized to apply to questions, as well as statements.
Nygren, Karl,
core +1 more source
CARNAP’S PROBLEM FOR MODAL LOGIC
, 2023 We take Carnap's problem to be to what extent standard consequence relations in various formal languages fix the meaning of their logical vocabulary, alone or together with additional constraints on the form of the semantics.
DENIS BONNAY +3 more
core +1 more source