- Quantifying over propositions in relevance logic: nonaxiomatisability of primary interpretations of ∀ p and ∃ p.Philip Kremer - 1993 - Journal of Symbolic Logic 58 (1):334-349.details
|
|
Every polynomial-time 1-degree collapses if and only if P = PSPACE.Stephen A. Fenner, Stuart A. Kurtz & James S. Royer - 2004 - Journal of Symbolic Logic 69 (3):713-741.details
|
|
Relativizing chaitin's halting probability.Rod Downey, Denis R. Hirschfeldt, Joseph S. Miller & André Nies - 2005 - Journal of Mathematical Logic 5 (02):167-192.details
|
|
Note on a system of Myhill.J. C. Shepherdson - 1956 - Journal of Symbolic Logic 21 (3):261-264.details
|
|
R. e. presented linear orders.Dev Kumar Roy - 1983 - Journal of Symbolic Logic 48 (2):369-376.details
|
|
(1 other version)Extensions of the constructive ordinals.Wayne Richter - 1965 - Journal of Symbolic Logic 30 (2):193-211.details
|
|
A discrete chain of degrees of index sets.Louise Hay - 1972 - Journal of Symbolic Logic 37 (1):139-149.details
|
|
Classifying positive equivalence relations.Claudio Bernardi & Andrea Sorbi - 1983 - Journal of Symbolic Logic 48 (3):529-538.details
|
|
Constructively accessible ordinal numbers.Wayne Richter - 1968 - Journal of Symbolic Logic 33 (1):43-55.details
|
|
Recursion theory on orderings. II.J. B. Remmel - 1980 - Journal of Symbolic Logic 45 (2):317-333.details
|
|
A generalisation of productive set.R. Mitchell - 1966 - Journal of Symbolic Logic 31 (3):455-459.details
|
|
Recursion theory on orderings. I. a model theoretic setting.G. Metakides & J. B. Remmel - 1979 - Journal of Symbolic Logic 44 (3):383-402.details
|
|
On the expressiveness of choice quantification.Bas Luttik - 2003 - Annals of Pure and Applied Logic 121 (1):39-87.details
|
|
Bounded enumeration reducibility and its degree structure.Daniele Marsibilio & Andrea Sorbi - 2012 - Archive for Mathematical Logic 51 (1-2):163-186.details
|
|
(1 other version)Splinters of recursive functions.J. S. Ullian - 1960 - Journal of Symbolic Logic 25 (1):33-38.details
|
|
Degrees of unsolvability associated with classes of formalized theories.Solomon Feferman - 1957 - Journal of Symbolic Logic 22 (2):161-175.details
|
|
Classes bounded by incomplete sets.Kejia Ho & Frank Stephan - 2002 - Annals of Pure and Applied Logic 116 (1-3):273-295.details
|
|
Effectively extensible theories.Marian Boykan Pour-El - 1968 - Journal of Symbolic Logic 33 (1):56-68.details
|
|
Index sets of finite classes of recursively enumerable sets.Louise Hay - 1969 - Journal of Symbolic Logic 34 (1):39-44.details
|
|
On computable numberings of families of Turing degrees.Marat Faizrahmanov - 2024 - Archive for Mathematical Logic 63 (5):609-622.details
|
|
Recursion theory on algebraic structures with independent sets.J. B. Remmel - 1980 - Annals of Mathematical Logic 18 (2):153.details
|
|
Dominical categories: recursion theory without elements.Robert A. di Paola & Alex Heller - 1987 - Journal of Symbolic Logic 52 (3):594-635.details
|
|
Kleene's amazing second recursion theorem.Yiannis N. Moschovakis - 2010 - Bulletin of Symbolic Logic 16 (2):189 - 239.details
|
|
The Discontinuity Problem.Vasco Brattka - 2023 - Journal of Symbolic Logic 88 (3):1191-1212.details
|
|
Theorie der Numerierungen I.Ju L. Eršov - 1973 - Mathematical Logic Quarterly 19 (19‐25):289-388.details
|
|
Elementary theories and hereditary undecidability for semilattices of numberings.Nikolay Bazhenov, Manat Mustafa & Mars Yamaleev - 2019 - Archive for Mathematical Logic 58 (3-4):485-500.details
|
|
Myhill's work in recursion theory.J. C. E. Dekker & E. Ellentuck - 1992 - Annals of Pure and Applied Logic 56 (1-3):43-71.details
|
|
Creativeness and completeness in recursion categories of partial recursive operators.Franco Montagna & Andrea Sorbi - 1989 - Journal of Symbolic Logic 54 (3):1023-1041.details
|
|
Belegradek, O., Verbovskiy, V. and Wagner, FO, Coset.J. Y. Halpern, B. M. Kapron, V. S. Harizanov, U. Kohlenbach, P. Oliva, F. Lucas, B. Luttik, P. Matet & M. Pourmahdian - 2003 - Annals of Pure and Applied Logic 121 (1):287.details
|
|
On the indexing of classes of recursively enumerable sets.A. H. Lachlan - 1966 - Journal of Symbolic Logic 31 (1):10-22.details
|
|
Pa Relative to an Enumeration Oracle.G. O. H. Jun Le, Iskander Sh Kalimullin, Joseph S. Miller & Mariya I. Soskova - 2023 - Journal of Symbolic Logic 88 (4):1497-1525.details
|
|
A Recursion‐theoretic View of Axiomatizable Theories.Marian Boykan Pour-El - 1970 - Dialectica 24 (4):267-276.details
|
|
(1 other version)Gödel numberings of partial recursive functions.Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (3):331-341.details
|
|