Results 71 to 80 of about 191,191 (174)
Cut-elimination and Normalization Theorems for Connexive Logics over Wansing’s C
Bulletin of the Section of LogicGentzen-style sequent calculi and Gentzen-style natural deduction systems are introduced for a family (C-family) of connexive logics over Wansing’s basic constructive connexive logic C.
Norihiro Kamide
doaj +1 more source
B-f jump characteristics in smooth sloping beds [PDF]
مهندسی منابع آب, 2019 Beacause of the hydraulic jump unstable behavior in adverse-slope stilling basins downstream of sloping beds, the jump toe is transmitted on sloping bed. Therefore, formation of the B-F jump is common in practice.
منوچهر شکریان +1 more
doaj
A theorem-proving approach to deciding properties of finite control agents [PDF]
, 1996 The report presents a decision procedure for assertions in an extension of the mu-calculus about finite-control pi-calculus agents. The procedure is based on the classical cut-free sequent calculus and associated techniques of automatic theorem ...
Franzén, Torkel
core +1 more source
Investigation of Hydraulic Jump Characteristics at Roughened Bed of Sudden Expansion Stilling Basin [PDF]
علوم و مهندسی آبیاری, 2014 Stilling basins of sudden expansion are one of the energy dissipater structures which can dissipate most of the kinetin energy of the flow through hydraulic jump.
Kobra Neysi +3 more
doaj
Electronic Notes in Theoretical Computer Science, 2009 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 ...
Gabbay, Michael, Gabbay, Murdoch J.
openaire +1 more source
, 2010 We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested sequents stay inside the modal language and allow for proof systems which enjoy the subformula property in the literal
openaire +2 more sources
The Hidden Structural Rules of the Discontinuous Lambek Calculus
, 2013 The sequent calculus sL for the Lambek calculus L (lambek 58) has no structural rules. Interestingly, sL is equivalent to a multimodal calculus mL, which consists of the nonassociative Lambek calculus with the structural rule of associativity. This paper
A. Avron +3 more
core +1 more source
Loop-check free sequent calculi for unary fragment of temporal logic
Lietuvos Matematikos RinkinysThis paper explores the construction of an efficient sequent calculus for a selected fragment of porpositional linear temporal logic (PLTL), extending the ideas of classical calculi discussed in [1], and builds upon previous investigations into the ...
Lukas Maksimiak, Adomas Birštunas
doaj +1 more source
Modal Linear Logic in Higher Order Logic, an experiment in Coq
, 2003 The sequent calculus of classical modal linear logic KDT 4lin is coded in the higher order logic using the proof assistant COQ. The encoding has been done using two-level meta reasoning in Coq.
Sadrzadeh, Mehrnoosh
core +1 more source
Nested Sequents for Intuitionistic Logics [PDF]
Notre Dame Journal of Formal Logic, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources