𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The logical nature of arithmetic

✍ Scribed by Th. Skolem

Publisher
Springer Netherlands
Year
1955
Tongue
English
Weight
542 KB
Volume
9
Category
Article
ISSN
0039-7857

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Arithmetic complexity of the predicate l
Arithmetic complexity of the predicate logics of certain complete arithmetic theories
✍ Valery Plisko πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 137 KB

It is proved in this paper that the predicate logic of each complete constructive arithmetic theory T having the existential property is T 1 -complete. In this connection, the techniques of a uniform partial truth deΓΏnition for intuitionistic arithmetic theories is used. The main theorem is applied

On the nature of some logical paradoxes
On the nature of some logical paradoxes
✍ V. Pinkava πŸ“‚ Article πŸ“… 1977 πŸ› Elsevier Science βš– 902 KB

The paper makes explicit the nature of some logical paradoxes by representing them in the form of logical nets, or simple finite automata expressed in the structural language as logical nets, both binary and non-classic multivalued ones. In this representation the structure of the problems turning e

PROVABILITY LOGIC IN THE GENTZEN FORMULA
PROVABILITY LOGIC IN THE GENTZEN FORMULATION OF ARITHMETIC
✍ Paolo Gentilini; P. Gentilini πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 796 KB

## Abstract In this paper are studied the properties of the proofs in PRA of provability logic sentences, i.e. of formulas which are Boolean combinations of formulas of the form P~IPRA~(h), where h is the GΓΆdel‐number of a sentence in PRA. The main result is a Normal Form Theorem on the proof‐trees