Funkcje rekurencyjne i elementy metamatematyki: problemy zupełności, rozstrzygalności, twierdzenia Gödla

Poznań: Wydawn. Naukowe Uniwersytetu im. Adama Mickiewicza w Poznaniu (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Call number

QA9.615.M87 1990

ISBN(s)

8323203555
View all bargains

Buy this book

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel's Theorems.Rod J. L. Adams & Roman Murawski - 1999 - Dordrecht, Netherland: Springer Verlag.
Completeness of the primitive recursive $$omega $$ ω -rule.Emanuele Frittaion - 2020 - Archive for Mathematical Logic 59 (5-6):715-731.
A Decidability Theorem.Vitaly Filippovski - 2009 - Analytica 3:78-91.
Metamathematics, machines, and Gödel's proof.N. Shankar - 1994 - New York: Cambridge University Press.
An elementary system as and its semi‐completeness and decidability.Qin Jun - 1992 - Mathematical Logic Quarterly 38 (1):305-320.
Roman Murawski, recursive functions and metamathematics: Problems of completeness and decidability.E. Mendelson - 2000 - Philosophia Mathematica 8 (3):345-346.
S(zp, zp): post-structural readings of Gödel's proof.Roy Wagner - 2009 - Milano: Polimetrica.
Induction, bounding, weak combinatorial principles, and the homogeneous model theorem.Denis Roman Hirschfeldt - 2017 - Providence, Rhode Island: American Mathematical Society. Edited by Karen Lange & Richard A. Shore.
The noneffectivity of Arslanov’s completeness criterion and related theorems.Sebastiaan A. Terwijn - 2020 - Archive for Mathematical Logic 59 (5-6):703-713.
The road to two theorems of logic.William Craig - 2008 - Synthese 164 (3):333 - 339.
A lift of a theorem of Friedberg: A Banach-Mazur functional that coincides with no α-recursive functional on the class of α-recursive functions.Robert A. di Paola - 1981 - Journal of Symbolic Logic 46 (2):216-232.
Semantical Completeness of First-Order Predicate Logic and the Weak Fan Theorem.Victor N. Krivtsov - 2015 - Studia Logica 103 (3):623-638.
Some applications of computable one-one numberings.Martin Kummer - 1990 - Archive for Mathematical Logic 30 (4):219-230.
A Sahlqvist Theorem for Relevant Modal Logics.Takahiro Seki - 2003 - Studia Logica 73 (3):383-411.
A Sahlqvist theorem for relevant modal logics.Takahiro Seki - 2003 - Studia Logica 73 (3):383-411.

Analytics

Added to PP
2023-05-19

Downloads
3 (#1,686,544)

6 months
2 (#1,232,442)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references