Results 241 to 250 of about 118,936 (260)
Some of the next articles are maybe not open access.
The modal logic of provability: Cut-elimination
Journal of Philosophical Logic, 1983\textit{D. Leivant} [J. Symb. Logic 46, 531--538 (1981; Zbl 0464.03019)] outlined a cut-elimination procedure for the formulation of the provability logic GL based on the only modal rule \(X,\square X,\square A\to A/\square X\to \square A\). The author and \textit{G. Sambin} [J. Philos.
openaire +3 more sources
2020
In this chapter we first introduce a standard cut-elimination procedure for the first-order logic and the \(\omega \)-logic, by which we see that the tree-height of the resulting cut-free proofs is bounded by a tower of exponential functions. Such a control of the tree-heights in cut-elimination is one of the most important results in ordinal analysis.
openaire +1 more source
In this chapter we first introduce a standard cut-elimination procedure for the first-order logic and the \(\omega \)-logic, by which we see that the tree-height of the resulting cut-free proofs is bounded by a tower of exponential functions. Such a control of the tree-heights in cut-elimination is one of the most important results in ordinal analysis.
openaire +1 more source
Corrected upper bounds for free-cut elimination
Theoretical Computer Science, 2011Arnold Beckmann, Samuel R Buss
exaly
Sufficient conditions for cut elimination with complexity analysis
Annals of Pure and Applied Logic, 2007João Rasga
exaly
Tobacco control initiatives cut the number of lung cancer deaths in California by 28%
Ca-A Cancer Journal for Clinicians, 2019Mike Fillon
exaly
Towards a clausal analysis of cut-elimination
Journal of Symbolic Computation, 2006Alexander Leitsch, Matthias Baaz
exaly
Interpolants, cut elimination and flow graphs for the propositional calculus
Annals of Pure and Applied Logic, 1997Alessandra Carbone
exaly