Results 21 to 30 of about 28,623 (311)
Efficient loop-check for multimodal KD45n logic
We introduce sequent calculus for multi-modal logic KD45n which uses efficient loop-check. Efficiency of the used loop-check is obtained by using marked modal operator squarei which is used as an alternative to sequent with histories ([2,3]).We use ...
Adomas Birštunas
doaj +1 more source
Multi-succedent sequent calculus for intuitionistic epistemic logic
A 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
DEL-sequents for progression [PDF]
Dynamic Epistemic Logic (DEL) deals with the representation and the study in a multi-agent setting of knowledge and belief change. It can express in a uniform way epistemic statements about: (i) what is true about an initial situation (ii) what is true about an event occurring in this situation (iii) what is true about the resulting situation after the
openaire +1 more source
Sequent Calculi for Choice Logics
AbstractChoice logics constitute a family of propositional logics and are used for the representation of preferences, with especiallyqualitative choice logic(QCL) being an established formalism with numerous applications in artificial intelligence. While computational properties and applications of choice logics have been studied in the literature ...
Michael Bernreiter +3 more
openaire +2 more sources
Admissibility, compatibility, and deducibility in first-order sequent logics [PDF]
The paper is about the notions of admissibility and compatibility and their significance for deducibility in different sequent logics including first-order classical and intuitionistic ones both without and with equality and, possibly, with modal rules.
Alexander Lyaletski
doaj
Sequent depth ratio of B-jumps on smooth and rough beds
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
AbstractWe consider a term sequent logic for the lambda-calculus. Term sequents are a judgement form similar to the logical judgement form of entailment between sentences, but denoting equality or reducibility between terms. Using term sequents, it is possible to treat lambda-terms almost like logical sentences, and to use proof-theoretic methods to ...
Michael Gabbay 0001 +1 more
openaire +1 more source
One-Sided Sequent Systems for Nonassociative Bilinear Logic: Cut Elimination and Complexity
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
Quantifier elimination by dependency sequents [PDF]
All the changes we made with respect to the previous versions are listed in the footnotes. The main change is that we modified the definition of a D-sequent using the notion of scoped redundancy of variables.
Eugene Goldberg, Panagiotis Manolios
openaire +4 more sources
Brodsky’s coding method for propositional logic
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

