Graduate studies at Western
Journal of Symbolic Logic 77 (1):291-307 (2012)
|Abstract||The truth-table degree of the set of shortest programs remains an outstanding problem in recursion theory. We examine two related sets, the set of shortest descriptions and the set of domain-random strings, and show that the truth-table degrees of these sets depend on the underlying acceptable numbering. We achieve some additional properties for the truth-table incomplete versions of these sets, namely retraceability and approximability. We give priority-free constructions of bounded truth-table chains and bounded truth-table antichains inside the truth-table complete degree by identifying an acceptable set of domain-random strings within each degree|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Marga Reimer (1992). Incomplete Descriptions. Erkenntnis 37 (3):347 - 363.
Branden Fitelson (2002). Shortest Axiomatizations of Implicational S4 and S5. Notre Dame Journal of Formal Logic 43 (3):169-179.
M. A. Holst (2013). Incomplete Descriptions and (Reverse) Sobel Sequences. Analysis 73 (1):26-32.
Zachary Ernst, Branden Fitelson, Kenneth Harris & Larry Wos (2002). Shortest Axiomatizations of Implicational S4 and S. Notre Dame Journal of Formal Logic 43 (3):169-179.
Carlo Penco (2010). Essentially Incomplete Descriptions. European Journal of Analytic Philosophy 6 (2):47 - 66.
Scott Soames (2009). Philosophical Essays: Natural Language: What It Means and How We Use It. Princeton University Press.
Christopher Gauker (2012). What Tipper is Ready For: A Semantics for Incomplete Predicates. Noûs 46 (1):61-85.
Nathan U. Salmon (1982). Assertion and Incomplete Definite Descriptions. Philosophical Studies 42 (1):37--45.
Jonardon Ganeri (1995). Contextually Incomplete Descriptions: A New Counterexample to Russell? Analysis 55 (4):287 - 290.
Scott Soames (1986). Incomplete Definite Descriptions. Notre Dame Journal of Formal Logic 27 (3):349--375.
Stephen A. Fenner (1994). Almost Weakly 2-Generic Sets. Journal of Symbolic Logic 59 (3):868-887.
Sorry, there are not enough data points to plot this chart.
Added to index2012-01-21
Recent downloads (6 months)0
How can I increase my downloads?