- The distribution of properly Σ20 e-degrees.Stanislaw Bereznyuk, Richard Coles & Andrea Sorbi - 2000 - Journal of Symbolic Logic 65 (1):19-32.details
|
|
On the relation provable equivalence and on partitions in effectively inseparable sets.Claudio Bernardi - 1981 - Studia Logica 40 (1):29 - 37.details
|
|
Effective Transformations on Probabilistic Data.Jan Bergstra - 1979 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 25 (13-18):219-226.details
|
|
Recursively enumerable complexity sequences and measure independence.Victor L. Bennison - 1980 - Journal of Symbolic Logic 45 (3):417-438.details
|
|
The complexity of ODDnA.Richard Beigel, William Gasarch, Martin Kummer, Georgia Martin, Timothy Mcnicholl & Frank Stephan - 2000 - Journal of Symbolic Logic 65 (1):1-18.details
|
|
The nonderivability in intuitionistic formal systems of theorems on the continuity of effective operations.Michael J. Beeson - 1975 - Journal of Symbolic Logic 40 (3):321-346.details
|
|
A characterization of jump operators.Howard Becker - 1988 - Journal of Symbolic Logic 53 (3):708-728.details
|
|
Effective coloration.Dwight R. Bean - 1976 - Journal of Symbolic Logic 41 (2):469-480.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
|
|
Rekursive Algebren mit Kettenbedingungen.Walter Baur - 1974 - Mathematical Logic Quarterly 20 (1‐3):37-46.details
|
|
Theorems of hyperarithmetic analysis and almost theorems of hyperarithmetic analysis.James S. Barnes, Jun le Goh & Richard A. Shore - 2022 - Bulletin of Symbolic Logic 28 (1):133-149.details
|
|
On Some Properties of Recursively Enumerable Equivalence Relations.Stefano Baratella - 1989 - Mathematical Logic Quarterly 35 (3):261-268.details
|
|
Degrees of sensible lambda theories.Henk Barendregt, Jan Bergstra, Jan Willem Klop & Henri Volken - 1978 - Journal of Symbolic Logic 43 (1):45-55.details
|
|
The jump operation for structure degrees.V. Baleva - 2005 - Archive for Mathematical Logic 45 (3):249-265.details
|
|
Machine learning of higher-order programs.Ganesh Baliga, John Case, Sanjay Jain & Mandayam Suraj - 1994 - Journal of Symbolic Logic 59 (2):486-500.details
|
|
Espace, temps et cognition.Francis Bailly & Giuseppe Longo - 2003 - Revue de Synthèse 124 (1):61-118.details
|
|
Weakly precomplete computably enumerable equivalence relations.Serikzhan Badaev & Andrea Sorbi - 2016 - Mathematical Logic Quarterly 62 (1-2):111-127.details
|
|
Rogers semilattices of families of two embedded sets in the Ershov hierarchy.Serikzhan A. Badaev, Mustafa Manat & Andrea Sorbi - 2012 - Mathematical Logic Quarterly 58 (4-5):366-376.details
|
|
How to Nominalize Formalism &dagger.Jody Azzouni - 2005 - Philosophia Mathematica 13 (2):135-159.details
|
|
Recursive Structures and Ershov's Hierarchy.Christopher J. Ash & Julia F. Knight - 1996 - Mathematical Logic Quarterly 42 (1):461-468.details
|
|
Decidable subspaces and recursively enumerable subspaces.C. J. Ash & R. G. Downey - 1984 - Journal of Symbolic Logic 49 (4):1137-1145.details
|
|
A construction for recursive linear orderings.C. J. Ash - 1991 - Journal of Symbolic Logic 56 (2):673-683.details
|
|
On first-order theories with provability operator.Sergei Artëmov & Franco Montagna - 1994 - Journal of Symbolic Logic 59 (4):1139-1153.details
|
|
Many levels: More than one is algorithmic.Michael A. Arbib - 1987 - Behavioral and Brain Sciences 10 (3):478-479.details
|
|
Recursive Polish spaces.Tyler Arant - 2023 - Archive for Mathematical Logic 62 (7):1101-1110.details
|
|
Arithmetical independence results using higher recursion theory.Andrew Arana - 2004 - Journal of Symbolic Logic 69 (1):1-8.details
|
|
Semantics of the infinitistic rules of proof.Krzysztof Rafal Apt - 1976 - Journal of Symbolic Logic 41 (1):121-138.details
|
|
The complements of lower cones of degrees and the degree spectra of structures.Uri Andrews, Mingzhong Cai, Iskander Sh Kalimullin, Steffen Lempp, Joseph S. Miller & Antonio Montalbán - 2016 - Journal of Symbolic Logic 81 (3):997-1006.details
|
|
Methodologies for studying human knowledge.John R. Anderson - 1987 - Behavioral and Brain Sciences 10 (3):467-477.details
|
|
Jump degrees of torsion-free abelian groups.Brooke M. Andersen, Asher M. Kach, Alexander G. Melnikov & Reed Solomon - 2012 - Journal of Symbolic Logic 77 (4):1067-1100.details
|
|
Initial Segments of the Degrees of Ceers.Uri Andrews & Andrea Sorbi - 2022 - Journal of Symbolic Logic 87 (3):1260-1282.details
|
|
Incomplete Contracts and Complexity Costs.Luca Anderlini & Leonardo Felli - 1999 - Theory and Decision 46 (1):23-50.details
|
|
Implementations, algorithms, and more.John R. Anderson - 1987 - Behavioral and Brain Sciences 10 (3):498-505.details
|
|
Trial and error mathematics II: Dialectical sets and quasidialectical sets, their degrees, and their distribution within the class of limit sets.Jacopo Amidei, Duccio Pianigiani, Luca San Mauro & Andrea Sorbi - 2016 - Review of Symbolic Logic 9 (4):810-835.details
|
|
Trial and error mathematics I: Dialectical and quasidialectical systems.Jacopo Amidei, Duccio Pianigiani, Luca San Mauro, Giulia Simi & Andrea Sorbi - 2016 - Review of Symbolic Logic 9 (2):299-324.details
|
|
Parsimony hierarchies for inductive inference.Andris Ambainis, John Case, Sanjay Jain & Mandayam Suraj - 2004 - Journal of Symbolic Logic 69 (1):287-327.details
|
|
Degree theoretical splitting properties of recursively enumerable sets.Klaus Ambos-Spies & Peter A. Fejer - 1988 - Journal of Symbolic Logic 53 (4):1110-1137.details
|
|
Copying One of a Pair of Structures.Rachael Alvir, Hannah Burchfield & Julia F. Knight - 2022 - Journal of Symbolic Logic 87 (3):1201-1214.details
|
|
Recursively enumerable sets which are uniform for finite extensions.Donald A. Alton - 1971 - Journal of Symbolic Logic 36 (2):271-287.details
|
|
Diversity of speed-ups and embeddability in computational complexity.Donald A. Alton - 1976 - Journal of Symbolic Logic 41 (1):199-214.details
|
|
Undecidability of the identity problem for finite semigroups.Douglas Albert, Robert Baldinger & John Rhodes - 1992 - Journal of Symbolic Logic 57 (1):179-192.details
|
|
Some Special Pairs of Σ2 e-Degrees.Seema Ahmad & Alistair H. Lachlan - 1998 - Mathematical Logic Quarterly 44 (4):431-449.details
|
|
Embedding the diamond in the σ2 enumeration degree.Seema Ahmad - 1991 - Journal of Symbolic Logic 56 (1):195 - 212.details
|
|
Inductive Inference and Unsolvability.Leonard M. Adleman & M. Blum - 1991 - Journal of Symbolic Logic 56 (3):891-900.details
|
|
Turing’s Responses to Two Objections.Darren Abramson - 2008 - Minds and Machines 18 (2):147-167.details
|
|
Σ1-separation.Fred G. Abramson - 1979 - Journal of Symbolic Logic 44 (3):374 - 382.details
|
|
Decision problems for tag systems.Stål Aanderaa & Dag Belsnes - 1971 - Journal of Symbolic Logic 36 (2):229-239.details
|
|
Realizability semantics for quantified modal logic: Generalizing flagg’s 1985 construction.Benjamin G. Rin & Sean Walsh - 2016 - Review of Symbolic Logic 9 (4):752-809.details
|
|
Non-empty open intervals of computably enumerable sQ 1-degrees.Roland Omanadze & Irakli Chitaia - forthcoming - Logic Journal of the IGPL.details
|
|
Essential hereditary undecidability.Albert Visser - forthcoming - Archive for Mathematical Logic:1-34.details
|
|