zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
The logic of arithmetical hierarchy. (English) Zbl 0804.03045
Formulas of the propositional modal language with the unary modal operators $\square$, $\Sigma\sb 1, \bbfB\sb 1, \Sigma\sb 2, \bbfB\sb 2$, etc. are considered as schemata of sentences of arithmetic (PA), where $\square A$ is interpreted as (a formalization of) “$A$ is PA- provable”, $\Sigma\sb nA$ as “$A$ is PA-equivalent to a $\Sigma\sb n$- sentence” and $\bbfB\sb n A$ as “$A$ is PA-equivalent to a Boolean combination of $\Sigma\sb n$-sentences”. We give an axiomatization and show decidability of the sets of the modal formulas which are schemata of: (1) PA-provable, (2) true arithmetical sentences.
Reviewer: G.Dzhaparidze
03F30First-order arithmetic and fragments
03B45Modal logic, etc.
Full Text: DOI
[1] Beklemishev, L.: On the complexity of arithmetical translations of propositional modal formulae. ITLI prepublication series (1990)
[2] Boolos, G.: The unprovability of consistency. (1979) · Zbl 0409.03009
[3] Dzhaparidze, G.: Probability logic with modalities for arithmetical complexities. Bull. acad. Sci. 138, No. 3, 481-484 (1990) · Zbl 0714.03018
[4] Guaspari, D.: Sentences implying their own provability. J. symbolic logic 48, 777-789 (1983) · Zbl 0547.03035
[5] De Jongh, D.; Pianigiani, D.: Solution of a problem of david guaspari. ITLI prepublication series (1990)
[6] Kent, C.: The relation of A to prov[A] in the lindenbaum sentence algebra. J. symbolic logic 38, 295-298 (1973) · Zbl 0275.02034
[7] Smorynski, C.: Self-reference and modal logic. (1985)
[8] Smorynski, C.: Incompleteness theorems. Handbook of mathematical logic (1977) · Zbl 0367.02019
[9] Solovay, R. M.: Probability interpreations of modal logic. Israel J. Math. 25, 287-304 (1976) · Zbl 0352.02019
[10] Visser, A.: A course in bimodal probability logic. Logic group preprint series (1987)