AXIOMATIZATION OF PROVABLE n-PROVABILITY
Work
Year: 2019
Type: article
Abstract: A formula $\phi$ is called \emph{$n$-provable} in a formal arithmetical theory $S$ if $\phi$ is provable in $S$ together with all true arithmetical $\Pi_{n}$-sentences taken as additional axioms. Whil... more
Source: Journal of Symbolic Logic
Authors Е. А. Колмаков, Lev D. Beklemishev
Cites: 17
Cited by: 5
Related to: 10
FWCI: 0.422
Citation percentile (by year/subfield): 76.22
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green