A Natural Axiomatization of Computability and Proof of Church's Thesis

Bulletin of Symbolic Logic - United Kingdom
doi 10.2178/bsl/1231081370
Full Text
Abstract

Available in full text

Categories
PhilosophyLogic
Date
Authors
Publisher

Cambridge University Press (CUP)

Related search

Axiomatization and Computability of a Variant of Iteration-Free PDL With Fork

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

A Proof of the Equivalence of Computability to Recursiveness With No Arithmetization

Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics
1970English

Local Computability of Computable Metric Spaces and Computability of co-c.e. Continua

Glasnik Matematicki
Mathematics
2012English

The Explanatory Role of the Weak Natural Law Thesis*

2013English

Computability of a Wedge of Circles

Rad Hrvatske Akademije Znanosti i Umjetnosti, Matematicke Znanosti
Mathematics
2017English

Correction To: Formal and Natural Proof: A Phenomenological Approach

2019English

Towards a Formal Theory of Computability

English

The Axiomatization of Propositional Logic

Formalized Mathematics
Computational MathematicsApplied Mathematics
2016English

Effect of Meaningfulness on Judgments of Computability

Memory and Cognition
ArtsNeuropsychologyCognitive PsychologyHumanitiesPhysiological PsychologyMedicineExperimental
1975English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy