SearcharxivSearch

arXiv · 0904.4742

Analysis and Extension of Omega-Rule

Abstract

$\Omega$-rule was introduced by W. Buchholz to give an ordinal-free cut-elimination proof for a subsystem of analysis with $\Pi^{1}_{1}$-comprehension. His proof provides cut-free derivations by familiar rules only for arithmetical sequents. When second-order quantifiers are present, they are introduced by $\Omega$-rule and some residual cuts are not eliminated. Using an extension of $\Omega$-rule we obtain (by the same method as W. Buchholz) complete cut-elimination: any derivation of arbitrary sequent is transformed into its cut-free derivation by the standard rules (with induction replaced by $\omega$-rule). W. Buchholz used $\Omega$-rule to explain how reductions of finite derivations (used by G. Takeuti for subsystems of analysis) are generated by cut-elimination steps applied to derivations with $\Omega$-rule. We show that the same steps generate standard cut-reduction steps for infinitary derivations with familiar standard rules for second-order quantifiers. This provides an analysis of $\Omega$-rule in terms of standard rules and ordinal-free cut-elimination proof for the system with the standard rules for second-order quantifiers. In fact we treat the subsystem of $\Pi^{1}_{1}$-CA (of the same strength as $ID_{1}$) that W. Buchholz used for his explanation of finite reductions. Extension to full $\Pi^{1}_{1}$-CA is forthcoming in another paper.

Explore related subjects

Keep this discovery

BibTeXRIS

R. Akiyoshi, G. Mints. 2009-04-30. Analysis and Extension of Omega-Rule. https://arxiv.org/abs/0904.4742

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO