Results 21 to 30 of about 28,341 (293)
Logic of knowledge with infinitely many agents
Lietuvos Matematikos Rinkinys, 2023 Cut-free sequent calculus for logic of knowledge with infinitely many agents, based on multimodul S5n.
Regimantas Pliuškevičius
doaj +3 more sources
Brodsky’s coding method for propositional logic
Lietuvos Matematikos Rinkinys, 2017 Brodsky’s coding method for propositional logic is considered in the paper. Based on the sequent calculus, the method allows us to determine whether an arbitrary sequent is derivable in the calculus without constructing proof-search trees.
Romas Alonderis
doaj +1 more source
One-Sided Sequent Systems for Nonassociative Bilinear Logic: Cut Elimination and Complexity
Bulletin of the Section of Logic, 2021 Bilinear Logic of Lambek amounts to Noncommutative MALL of Abrusci. Lambek proves the cut–elimination theorem for a one-sided (in fact, left-sided) sequent system for this logic.
Paweł Płaczek
doaj +1 more source
Partial cut elimination for propositional discrete linear time temporal logic
Lietuvos Matematikos Rinkinys, 2010 We consider propositional discrete linear time temporal logic with future and past operators of time. For each formula ϕ of this logic, we present Gentzen-type sequent calculus Gr(ϕ) with a restricted cut rule.
Jūratė Sakalauskaitė
doaj +1 more source
A Proof Theoretic Analysis of Intruder Theories [PDF]
Logical Methods in Computer Science, 2010 We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages Gamma under the theory of blind signatures and arbitrary convergent equational theories modulo ...
Alwen F Tiu, Rajeev Gore, Jeremy Dawson
doaj +1 more source
Sequent calculus for hybrid logic
Lietuvos Matematikos Rinkinys, 2023 There is not ...
Stanislovas Norgėla +1 more
doaj +1 more source
Proof-search of propositional intuitionistic logic sequents by means of classical logic calculus
Lietuvos Matematikos Rinkinys, 2008 In the paper, we define some classes of sequents of the propositional intuitionistic logic. These are classes of primarily and α-primarily reducible sequents. Then we show how derivability of these sequents in a propositional intuitionistic logic sequent
Romas Alonderis
doaj +1 more source
Journal of Wood Science, 2022 The outer bark that includes sequent periderms is referred to as rhytidome. The defense and physiological functions of rhytidome are maintained by the continuous formation of sequent periderms.
Megumi Ohse +6 more
doaj +1 more source
Sequent Calculi for the classical fragment of Bochvar and Halldén's Nonsense Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 In this paper sequent calculi for the classical fragment (that is, the conjunction-disjunction-implication-negation fragment) of the nonsense logics B3, introduced by Bochvar, and H3, introduced by Halldén, are presented.
Marcelo E. Coniglio, María I. Corbalán
doaj +1 more source
Sequent Systems for Negative Modalities [PDF]
Logica Universalis, 2017 AbstractNon-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate semantics and proof systems, whose philosophical interpretations and computational properties are found ...
Lahav, Ori, Marcos, João, Zohar, Yoni
openaire +3 more sources