Reduktionstypen der Prädikatenlogik

Münster i.: W., Westfälische Wilhelms-Universität Münster, Institut für Mathematische Logik und Grundlagenforschung (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Call number

QA9.R726

Links

PhilArchive



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

External links

  • This entry has no external links. Add one.
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

Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
Even Turing machines can compute uncomputable functions.Jack Copeland - unknown
From Symbol to ‘Symbol’, to Abstract Symbol: Response to Copeland and Shagrir on Turing-Machine Realism Versus Turing-Machine Purism.Eli Dresner & Ofra Rechter - 2016 - Minds and Machines 26 (3):253-257.
Infinite time Turing machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.
Computing Machines Can't Be Intelligent (...and Turing Said So).Peter Kugel - 2002 - Minds and Machines 12 (4):563-579.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Olympia and Other O-Machines.Colin Klein - 2015 - Philosophia 43 (4):925-931.
Infinite Time Turing Machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):521-539.
Undecidability over Continuous Time.Jerzy Mycka & José Félix Costa - 2006 - Logic Journal of the IGPL 14 (5):649-658.
Reflections on gödel's and Gandy's reflections on Turing's thesis.David Israel - 2002 - Minds and Machines 12 (2):181-201.
The church-Turing thesis and effective mundane procedures.Leon Horsten - 1995 - Minds and Machines 5 (1):1-8.
Logic & Natural Language: On Plural Reference and its Semantic and Logical Significance.Hanoch Ben-Yami - 2004 - Routledge.
Turing's o-machines, Searle, Penrose, and the brain.Jack Copeland - 1998 - Analysis 58 (2):128-138.
Kleene S. C.. Permutability of inferences in Gentzen's calculi LK and LJ. Two papers on the predicate calculus, by Kleene S. C. , lithographed, Providence 1952, pp. 1–26.Kleene S. C.. Finite axiomatizability of theories in the predicate calculus using additional predicate symbols. Two papers on the predicate calculus, by Kleene S. C. , lithographed, Providence 1952, pp. 27–66.Kleene S. C.. Bibliography. Two papers on the predicate calculus, by Kleene S. C. , lithographed, Providence 1952, pp. 67–68.Craig William. On axiomatizability within a system. [REVIEW]Robert McNaughton - 1954 - Journal of Symbolic Logic 19 (1):62-63.
Sets, Logic, Computation: An Open Introduction to Metalogic.Richard Zach - 2021 - Open Logic Project.

Analytics

Added to PP
2023-06-25

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references