Results for 'A. Lachlan'

(not author) ( search as author name )
966 found
Order:
  1.  17
    Recursively Enumerable Classes and Their Application to Recursive Sequences of Formal Theories.Marian Boykan Pour-el, Hilary Putnam, William A. Howard & A. H. Lachlan - 1973 - Journal of Symbolic Logic 38 (1):155-156.
  2.  12
    $aleph_0$-Categorical Tree-Decomposable Structures.A. H. Lachlan - 1992 - Journal of Symbolic Logic 57 (2):501-514.
    Our purpose in this note is to study countable $\aleph_0$-categorical structures whose theories are tree-decomposable in the sense of Baldwin and Shelah. The permutation group corresponding to such a structure can be decomposed in a canonical manner into simpler permutation groups in the same class. As an application of the analysis we show that these structures are finitely homogeneous.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  8
    The Priority Method I.A. H. Lachlans - 1967 - Mathematical Logic Quarterly 13 (1‐2):1-10.
  4.  24
    The Priority Method I.A. H. Lachlans - 1967 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 13 (1-2):1-10.
  5.  33
    Uniform enumeration operations.A. H. Lachlan - 1975 - Journal of Symbolic Logic 40 (3):401-409.
    Sacks [2] has asked whether there exists a uniform solution to Post's problem, i.e. an enumeration operation W such that $\mathbf{d} for every degree d. It is shown here that if such an operation W exists it cannot itself in a particular technical sense be uniform. In fact, the jump operation is characterized amongst such uniform enumeration operations by the condition: $\mathbf{d} for all d. In addition, it is proved that the only other uniform enumeration operations such that d ≤ (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6.  8
    A Note on Positive Equivalence Relations.A. H. Lachlan - 1987 - Mathematical Logic Quarterly 33 (1):43-46.
    Direct download  
     
    Export citation  
     
    Bookmark   13 citations  
  7.  29
    A Note on Positive Equivalence Relations.A. H. Lachlan - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (1):43-46.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   13 citations  
  8.  9
    The U‐Quantifier.A. H. Lachlan - 1961 - Mathematical Logic Quarterly 7 (11‐14):171-174.
  9.  20
    Initial Segments of Models of Peano's Axioms.L. A. S. Kirby, J. B. Paris, A. Lachlan, M. Srebrny & A. Zarach - 1983 - Journal of Symbolic Logic 48 (2):482-483.
  10.  36
    Bounding minimal pairs.A. H. Lachlan - 1979 - Journal of Symbolic Logic 44 (4):626-642.
  11.  7
    Distributive Initial Segments of the Degrees of Unsolvability.A. H. Lachlan - 1968 - Mathematical Logic Quarterly 14 (30):457-472.
    Direct download  
     
    Export citation  
     
    Bookmark   21 citations  
  12.  32
    Distributive Initial Segments of the Degrees of Unsolvability.A. H. Lachlan - 1968 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 14 (30):457-472.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   21 citations  
  13.  37
    Then-rea enumeration degrees are dense.Alistair H. Lachlan & Richard A. Shore - 1992 - Archive for Mathematical Logic 31 (4):277-285.
  14.  70
    ℵ0-Categorical, ℵ0-stable structures.G. Cherlin, L. Harrington & A. H. Lachlan - 1985 - Annals of Pure and Applied Logic 28 (2):103-135.
  15.  15
    Degrees of recursively enumerable sets which have no maximal supersets.A. H. Lachlan - 1968 - Journal of Symbolic Logic 33 (3):431-443.
  16.  33
    Countable initial segments of the degrees of unsolvability.A. H. Lachlan & R. Lebeuf - 1976 - Journal of Symbolic Logic 41 (2):289-300.
  17.  81
    On strongly minimal sets.J. T. Baldwin & A. H. Lachlan - 1971 - Journal of Symbolic Logic 36 (1):79-96.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   49 citations  
  18.  27
    A note on universal sets.A. H. Lachlan - 1966 - Journal of Symbolic Logic 31 (4):573-574.
    In this note is proved the following:Theorem.Iƒ A × B is universal and one oƒ A, B is r.e. then one of A, B is universal.Letα, τbe 1-argument recursive functions such thatxgoes to, τ) is a map of the natural numbers onto all ordered pairs of natural numbers. A set A of natural numbers is calleduniversalif every r.e. set is reducible to A; A × B is calleduniversalif the set.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  19.  16
    Spectra of ω‐Stable Theories.A. H. Lachlan - 1978 - Mathematical Logic Quarterly 24 (9‐11):129-139.
  20.  28
    The impossibility of finding relative complements for recursively enumerable degrees.A. H. Lachlan - 1966 - Journal of Symbolic Logic 31 (3):434-454.
  21.  29
    Spectra of ω‐Stable Theories.A. H. Lachlan - 1978 - Mathematical Logic Quarterly 24 (9-11):129-139.
  22.  22
    A remark on the strict order property.A. H. Lachlan - 1975 - Mathematical Logic Quarterly 21 (1):69-70.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  23.  29
    Standard Classes of Recursively Enumerable Sets.A. H. Lachlan - 1964 - Mathematical Logic Quarterly 10 (2-3):23-42.
  24.  53
    A note on Thomason's refined structures for tense logics.A. H. Lachlan - 1974 - Theoria 40 (2):117-120.
  25.  19
    Structures coordinatized by indiscernible sets.A. H. Lachlan - 1987 - Annals of Pure and Applied Logic 34 (3):245-273.
  26.  15
    Some Notions of Reducibility and Productiveness.A. H. Lachlan - 1965 - Mathematical Logic Quarterly 11 (1):17-44.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  27.  37
    On the indexing of classes of recursively enumerable sets.A. H. Lachlan - 1966 - Journal of Symbolic Logic 31 (1):10-22.
  28.  26
    Some Notions of Reducibility and Productiveness.A. H. Lachlan - 1965 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11 (1):17-44.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  29.  28
    Effective operations in a general setting.A. H. Lachlan - 1964 - Journal of Symbolic Logic 29 (4):163-178.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  30.  16
    J. R. Shoenfield. A theorem on minimal degrees. The journal of symbolic logic, vol. 31 , pp. 539–544.A. H. Lachlan - 1968 - Journal of Symbolic Logic 32 (4):529.
  31.  13
    On Recursive Enumeration Without Repetition: A Correction.A. H. Lachlan - 1967 - Mathematical Logic Quarterly 13 (7‐12):99-100.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  32.  33
    On Recursive Enumeration Without Repetition: A Correction.A. H. Lachlan - 1967 - Mathematical Logic Quarterly 13 (7-12):99-100.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  33.  52
    Complete theories with only universal and existential axioms.A. H. Lachlan - 1987 - Journal of Symbolic Logic 52 (3):698-711.
    Let T be a complete first-order theory over a finite relational language which is axiomatized by universal and existential sentences. It is shown that T is almost trivial in the sense that the universe of any model of T can be written $F \overset{\cdot}{\cup} I_1 \overset{\cdot}{\cup} I_2 \overset{\cdot}{\cup} \cdots \overset{\cdot}{\cup} I_n$ , where F is finite and I 1 , I 2 ,...,I n are mutually indiscernible over F. Some results about complete theories with ∃∀-axioms over a finite relational language (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  34.  28
    On Recursive Enumeration Without Repetition.A. H. Lachlan - 1965 - Mathematical Logic Quarterly 11 (3):209-220.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  35.  19
    Recursive real numbers.A. H. Lachlan - 1963 - Journal of Symbolic Logic 28 (1):1-16.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  36.  27
    On Recursive Enumeration Without Repetition.A. H. Lachlan - 1965 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11 (3):209-220.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  37.  16
    Some coinductive graphs.A. H. Lachlan - 1990 - Archive for Mathematical Logic 29 (4):213-229.
    LetT be a universal theory of graphs such that Mod(T) is closed under disjoint unions. Letℳ T be a disjoint union ℳ i such that eachℳ i is a finite model ofT and every finite isomorphism type in Mod(T) is represented in{ℳ i ∶i<Ω3}. We investigate under what conditions onT, Th(ℳ T ) is a coinductive theory, where a theory is called coinductive if it can be axiomatizated by ∃∀-sentences. We also characterize coinductive graphs which have quantifier-free rank 1.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  38.  51
    ℵ0-categorical tree-decomposable structures.A. H. Lachlan - 1992 - Journal of Symbolic Logic 57 (2):501 - 514.
    Our purpose in this note is to study countable ℵ0-categorical structures whose theories are tree-decomposable in the sense of Baldwin and Shelah. The permutation group corresponding to such a structure can be decomposed in a canonical manner into simpler permutation groups in the same class. As an application of the analysis we show that these structures are finitely homogeneous.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  39.  10
    Multiple Recursion.A. H. Lachlan - 1962 - Mathematical Logic Quarterly 8 (2):81-107.
  40.  28
    Multiple Recursion.A. H. Lachlan - 1962 - Mathematical Logic Quarterly 8 (2):81-107.
  41.  22
    The U‐Quantifier.A. H. Lachlan - 1961 - Mathematical Logic Quarterly 7 (11-14):171-174.
  42. Review: A. A. Mucnik, E. Mendelson, Isomorphism of Systems of Recursively Enumerable Sets with Effective Properties. [REVIEW]A. H. Lachlan - 1967 - Journal of Symbolic Logic 32 (3):393-394.
  43.  11
    1997 European Summer Meeting of the Association for Symbolic Logic.M. Hyland Hodges, A. H. Lachlan, A. Louveau, Y. N. Moschovakis, L. Pacholski, A. B. Slomson, J. K. Truss & S. S. Wainer - 1998 - Bulletin of Symbolic Logic 4 (1):55-117.
  44. Affect Against Ineffect: Comments on Vardoulakis’s Idea of the ‘Ineffectual’.Lachlan Liesfield - 2022 - Australasian Philosophical Review 6 (3):295-300.
    In this commentary I respond to the claims of Dimitris Vardoulakis that, following a mistake of Heidegger in his translation of Aristotle and the apparent loss of phronêsis, post-war continental philosophy has abandoned instrumental rationality and the calculation of utility, instead valorizing an ‘action without ends’ and instituting a ‘new Kantianism’ in its ethics, politics, and ontology. I do so by presenting the thought of Gilles Deleuze as one identified in this tradition who fails to be characterized by Vardoulakis’s claims, (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  45. Review: J. R. Shoenfield, A Theorem on Minimal Degrees. [REVIEW]A. H. Lachlan - 1967 - Journal of Symbolic Logic 32 (4):529-529.
  46.  6
    Review: Paul R. Young, An Effective Operator, Continuous but not Partial Recursive. [REVIEW]A. H. Lachlan - 1970 - Journal of Symbolic Logic 35 (3):477-478.
  47.  9
    Young Paul R.. An effective operator, continuous but not partial recursive. Proceedings of the American Mathematical Society, vol. 19 , pp. 103–108. [REVIEW]A. H. Lachlan - 1970 - Journal of Symbolic Logic 35 (3):477-478.
  48.  18
    Systema Temporis: A time-based dimensional framework for consciousness and cognition.Lachlan Kent, George Van Doorn & Britt Klein - 2019 - Consciousness and Cognition 73 (C):102766.
  49.  10
    Climate Justice Beyond the State.Lachlan Umbers & Jeremy Moss - 2020 - Oxford: Routledge.
    Virtually every figure in the climate justice literature agrees that states are presently failing to discharge their duties to take action on climate change. Few, however, have attempted to think through what follows from that fact from a moral point of view. In Climate Justice Beyond the State, Lachlan Umbers and Jeremy Moss argue that states’ failures to take action on climate change have important implications for the duties of the most important actors states contain within them – sub-national (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  50.  98
    Against Lottocracy.Lachlan Montgomery Umbers - 2018 - European Journal of Political Theory 20 (2):312-334.
    Dissatisfaction with democratic institutions has run high in recent years. Perhaps as a result, political theorists have begun to turn their attention to possible alternative modes of political dec...
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   11 citations  
1 — 50 / 966