Effectively extensible theories

Journal of Symbolic Logic 33 (1):56-68 (1968)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270052

Links

PhilArchive



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

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

On the relation provable equivalence and on partitions in effectively inseparable sets.Claudio Bernardi - 1981 - Studia Logica 40 (1):29 - 37.
Splittings of effectively speedable sets and effectively levelable sets.Roland S. H. Omanadze - 2004 - Journal of Symbolic Logic 69 (1):143-158.
Deduction-preserving ‘Recursive Isomorphisms’ between Theories.Marian Boykan Pour-El & Saul A. Kripke - 1967 - Fundamenta Mathematicae 61:141-163.
All Things Indefinitely Extensible.Stewart Shapiro & Crispin Wright - 2006 - In Agustín Rayo & Gabriel Uzquiano (eds.), ¸ Iterayo&Uzquiano:Ag. Clarendon Press. pp. 255--304.
Effectively retractable theories and degrees of undecidability.J. P. Jones - 1969 - Journal of Symbolic Logic 34 (4):597-604.
Sets and Indefinitely Extensible Concepts and Classes.Peter Clark - 1993 - Aristotelian Society Supplementary Volume 67:235--249.
Inductive inference in the limit of empirically adequate theories.Bernhard Lauth - 1995 - Journal of Philosophical Logic 24 (5):525 - 548.
On disagreement about perception.Kenneth M. Sayre - 1964 - Inquiry: An Interdisciplinary Journal of Philosophy 7 (1-4):143 – 162.
A Note On Formal Reasoning with Extensible Domain.Laureano Luna - 2009 - The Reasoner 3 (7):5-6.

Analytics

Added to PP
2009-01-28

Downloads
28 (#568,347)

6 months
2 (#1,192,898)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Effectively inseparable Boolean algebras in lattices of sentences.V. Yu Shavrukov - 2010 - Archive for Mathematical Logic 49 (1):69-89.
Essential hereditary undecidability.Albert Visser - forthcoming - Archive for Mathematical Logic:1-34.
There Are No Minimal Effectively Inseparable Theories.Yong Cheng - 2023 - Notre Dame Journal of Formal Logic 64 (4):425-439.
Rekursive Untrennbarkeit Bei Elementaren Theorien.Hans-Dietrich Hecker - 1971 - Mathematical Logic Quarterly 17 (1):443-463.

View all 6 citations / Add more citations

References found in this work

Creative sets.John Myhill - 1955 - Mathematical Logic Quarterly 1 (2):97-108.
Creative sets.John Myhill - 1955 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 1 (2):97-108.
Representability of recursively enumerable sets in formal theories.J. C. Shepherdson - 1961 - Archive for Mathematical Logic 5 (3-4):119-127.

Add more references