Results 21 to 30 of about 191,191 (174)
Polarizing Double Negation Translations [PDF]
, 2013 Double-negation translations are used to encode and decode classical proofs in intuitionistic logic. We show that, in the cut-free fragment, we can simplify the translations and introduce fewer negations.
A. Kolmogorov +14 more
core +4 more sources
Efficient loop-check for multimodal KD45n logic
Lietuvos Matematikos Rinkinys, 2021 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
Optimization of sizing of annual water storage reservoirs considering return period association
Acta Scientiarum: Technology, 2022 An increasing concern among water resources managers is the search for ways to improve reservoir sizing techniques. A simple technical and scientifically based technique is the sequent peak method, which has been widely disseminated, but presents ...
Aline de Araújo Nunes +3 more
doaj +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
Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents [PDF]
, 2019 We provide a direct method for proving Craig interpolation for a range of modal and intuitionistic logics, including those containing a "converse" modality. We demonstrate this method for classical tense logic, its extensions with path axioms, and for bi-
Clouston, Ranald +3 more
core +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
Sequent Calculi for Choice Logics
Journal of Automated Reasoning, 2022 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 ...
Bernreiter, M. +3 more
openaire +2 more sources
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
Admissibility, compatibility, and deducibility in first-order sequent logics [PDF]
Computer Science Journal of Moldova, 2015 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
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