Results 21 to 30 of about 165,353 (118)
A derivation-loop method for temporal logic
Lietuvos Matematikos Rinkinys, 2019 Various types of calculi (Hilbert, Gentzen sequent, resolution calculi, tableaux) for propositional linear temporal logic (PLTL) have been considered in the literature.
Romas Alonderis, Haroldas Giedra
doaj +1 more source
Sequent depth ratio of B-jumps on smooth and rough beds
Journal of Agricultural Engineering, 2013 A hydraulic B-jump has the toe section located on a positively sloping upstream channel and the roller end on a downstream horizontal channel. This paper analyses the B-jump on a rough bed, such as at the transition from a block ramp to the stilling ...
Francesco Giuseppe Carollo +2 more
doaj +3 more sources
Simple Decision Procedure for S5 in Standard Cut-Free Sequent Calculus [PDF]
, 2016 In the paper a decision procedure for S5 is presented which uses a cut-free sequent calculus with additional rules allowing a reduction to normal modal forms. It utilizes the fact that in S5 every formula is equivalent to some 1-degree formula, i.e.
Indrzejczak, Andrzej
core +1 more source
Multi-succedent sequent calculus for intuitionistic epistemic logic
Lietuvos Matematikos RinkinysA multi-succedent sequent calculus for intuitionistic epistemic logic (IEL) is introduced in the paper. It is proved that the structural rules of weakening and contraction and the rule of cut are admissible in the calculus.
Romas Alonderis
doaj +3 more sources
Proof Theory of Finite-valued Logics [PDF]
, 1993 The proof theory of many-valued systems has not been investigated to an extent comparable to the work done on axiomatizatbility of many-valued logics. Proof theory requires appropriate formalisms, such as sequent calculus, natural deduction, and tableaux
Zach, Richard
core +5 more sources
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
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
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
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
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