Some Completeness Results in the Mathematical Theory of Computation

Journal of Symbolic Logic 40 (2):246-247 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271924

Links

PhilArchive



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

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

Review: Donald M. Kaplan, Some Completeness Results in the Mathematical Theory of Computation. [REVIEW]Richard J. Orgass - 1975 - Journal of Symbolic Logic 40 (2):246-247.
Theory of quantum computation and philosophy of mathematics. Part I.Krzysztof Wójtowicz - 2009 - Logic and Logical Philosophy 18 (3-4):313-332.
Neural Computation and the Computational Theory of Cognition.Gualtiero Piccinini & Sonya Bahar - 2013 - Cognitive Science 37 (3):453-488.
The mathematics of logic: a guide to completeness theorems and their applications.Richard Kaye - 2007 - New York: Cambridge University Press.
Review: John McCarthy, A Basis for a Mathematical Theory of Computation, Preliminary Report; John McCarthy, P. Braffort, D. Hirschberg, A Basis for a Mathematical Theory of Computation. [REVIEW]Martin Davis - 1968 - Journal of Symbolic Logic 33 (1):117-117.
Measurement-Based Quantum Computation and Undecidable Logic.Maarten Van den Nest & Hans J. Briegel - 2008 - Foundations of Physics 38 (5):448-457.
A foundation for real recursive function theory.José Félix Costa, Bruno Loff & Jerzy Mycka - 2009 - Annals of Pure and Applied Logic 160 (3):255-288.
Transcending Turing computability.B. J. Maclennan - 2003 - Minds and Machines 13 (1):3-22.
Carnap on extremal axioms, "completeness of the models," and categoricity.Georg Schiemer - 2012 - Review of Symbolic Logic 5 (4):613-641.
On Binary Computation Structures.Bernhard Heinemann - 1997 - Mathematical Logic Quarterly 43 (2):203-215.
Tarskian Structured Consequence Relations and Functional Completeness.Heinrich Wansing - 1995 - Mathematical Logic Quarterly 41 (1):73-92.
Analytic completeness theorem for absolutely continuous biprobability models.Radosav S. Đorđević - 1992 - Mathematical Logic Quarterly 38 (1):241-246.
Review: J. McCarthy, Cicely M. Popplewell, Towards a Mathematical Science of Computation; John McCarthy, Wayne A. Kalenich, Problems in the Theory of Computation. [REVIEW]Richard J. Orgass - 1971 - Journal of Symbolic Logic 36 (2):346-347.
On P Versus NP for Parameter‐Free Programs Over Algebraic Structures.Armin Hemmerling - 2001 - Mathematical Logic Quarterly 47 (1):67-92.
Preservation theorems for bounded formulas.Morteza Moniri - 2007 - Archive for Mathematical Logic 46 (1):9-14.

Analytics

Added to PP
2015-02-05

Downloads
6 (#1,425,536)

6 months
6 (#522,885)

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