Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,287,049 papers from all fields of science
Search
Sign In
Create Free Account
Cut rule
In mathematical logic, the cut rule is an inference rule of sequent calculus. It is a generalisation of the classical modus ponens inference rule…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
2 relations
Admissible rule
Sequent calculus
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Numerically-aided Deductive Safety Proof for a Powertrain Control System
Nikos Aréchiga
,
J. Kapinski
,
Jyotirmoy V. Deshmukh
,
André Platzer
,
B. Krogh
Numerical Software Verification
2015
Corpus ID: 207604846
2014
2014
Informational Semantics, Non-Deterministic Matrices and Feasible Deduction
Marcello D'Agostino
Workshop on Logical and Semantic Frameworks with…
2014
Corpus ID: 2622222
2014
2014
Combining Paraconsistent Logic with Argumentation
Diana Grooters
,
H. Prakken
Comma
2014
Corpus ID: 13509005
One tradition in the logical study of argumentation is to allow for arguments that combine strict and defeasible inference rules…
Expand
2010
2010
Analytic Cut for Propositional Dynamic Logic
Chrysafis Hartonas
,
T. Larissa
2010
Corpus ID: 15012489
We present a Gentzen system GPDL for Propositional Dynamic Logic, deriving the classical Segerberg axiomatization from our system…
Expand
2009
2009
An Optimal Tableau Decision Procedure for Converse-PDL
Linh Anh Nguyen
,
A. Szałas
International Conference on Knowledge and Systems…
2009
Corpus ID: 904598
We give a novel tableau calculus and an optimal (EXPTIME)tableau decision procedure based on the calculus for the satisfiability…
Expand
2008
2008
Admissibility of Cut in Coalgebraic Logics
D. Pattinson
,
Lutz Schröder
International Workshop on Coalgebraic Methods in…
2008
Corpus ID: 14289349
Review
2000
Review
2000
First International Congress on Tools for teching Logic The Interactive Learning Environment WinKE for Teaching Deductive Reasoning
U. Endriss
2000
Corpus ID: 9894207
WinKE is an interactive proof assistant based on the KE calculus, a refutation system which combines features from Smullyan’s…
Expand
1997
1997
Quantiied Lax Logic Quantiied Lax Logic
M. Fairtlough
,
M. Walton
,
M. Fairtlough
1997
Corpus ID: 236507246
Lax Logic is an intuitionistic modal logic which has so far been investigated at the propositional level. It has shown itself to…
Expand
1996
1996
A Proper Hierarchy of Propositional Sequent Calculi
N. Arai
Theoretical Computer Science
1996
Corpus ID: 36759766
1993
1993
Machine Deduction
Christophe Faffalli
Types for Proofs and Programs
1993
Corpus ID: 27022213
We present in this paper a new type system which allows to extract code for an abstract machine instead of lambda-terms. Thus, we…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE