- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
On the relation provable equivalence and on partitions in effectively inseparable sets
Studia Logica 40 (1):29 - 37 (1981)
Abstract
We generalize a well-knownSmullyan's result, by showing that any two sets of the kindC a = {x/ xa} andC b = {x/ xb} are effectively inseparable (if I b). Then we investigate logical and recursive consequences of this fact (see Introduction).My notes
Similar books and articles
Effective inseparability, lattices, and preordering relations.Uri Andrews & Andrea Sorbi - forthcoming - Review of Symbolic Logic:1-28.
Weakly precomplete computably enumerable equivalence relations.Serikzhan Badaev & Andrea Sorbi - 2016 - Mathematical Logic Quarterly 62 (1-2):111-127.
Classifying positive equivalence relations.Claudio Bernardi & Andrea Sorbi - 1983 - Journal of Symbolic Logic 48 (3):529-538.
On the relationships between some meta-mathematical properties of arithmetical theories.Yong Cheng - forthcoming - Logic Journal of the IGPL.
The uniqueness of the fixed-point in every diagonalizable algebra.Claudio Bernardi - 1976 - Studia Logica 35 (4):335 - 343.
Decidability in Intuitionistic Type Theory is Functionally Decidable.Silvio Valentini - 1996 - Mathematical Logic Quarterly 42 (1):300-304.
Splittings of effectively speedable sets and effectively levelable sets.Roland S. H. Omanadze - 2004 - Journal of Symbolic Logic 69 (1):143-158.
Odd-sized partitions of Russell-sets.Horst Herrlich & Eleftherios Tachtsis - 2010 - Mathematical Logic Quarterly 56 (2):185-190.
On ideals of subsets of the plane and on Cohen reals.Jacek Cichoń & Janusz Pawlikowski - 1986 - Journal of Symbolic Logic 51 (3):560-569.
On the construction of effectively random sets.Wolfgang Merkle & Nenad Mihailović - 2004 - Journal of Symbolic Logic 69 (3):862-878.
Analytics
Added to PP
2009-01-28
Downloads
8 (#1,345,183)
6 months
36 (#102,577)
2009-01-28
Downloads
8 (#1,345,183)
6 months
36 (#102,577)
Historical graph of downloads
Citations of this work
Classifying positive equivalence relations.Claudio Bernardi & Andrea Sorbi - 1983 - Journal of Symbolic Logic 48 (3):529-538.
Universal computably enumerable equivalence relations.Uri Andrews, Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Luca San Mauro & Andrea Sorbi - 2014 - Journal of Symbolic Logic 79 (1):60-88.
Relatively precomplete numerations and arithmetic.Franco Montagna - 1982 - Journal of Philosophical Logic 11 (4):419 - 430.
Graphs realised by r.e. equivalence relations.Alexander Gavruskin, Sanjay Jain, Bakhadyr Khoussainov & Frank Stephan - 2014 - Annals of Pure and Applied Logic 165 (7-8):1263-1290.
Jumps of computably enumerable equivalence relations.Uri Andrews & Andrea Sorbi - 2018 - Annals of Pure and Applied Logic 169 (3):243-259.
References found in this work
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
On the algebraization of a Feferman's predicate.Franco Montagna - 1978 - Studia Logica 37 (3):221 - 236.
Recursively enumerable classes and their application to recursive sequences of formal theories.Marian Boykan Pour-El & Hilary Putnam - 1965 - Archive for Mathematical Logic 8 (3-4):104-121.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-68866f4b87-tsllw uwo