Switch to: Citations

Add references

You must login to add references.
  1. [Introduction].Wilfrid Hodges - 1986 - Journal of Symbolic Logic 51 (4):865.
    We consider two formalisations of the notion of a compositionalsemantics for a language, and find some equivalent statements in termsof substitutions. We prove a theorem stating necessary and sufficientconditions for the existence of a canonical compositional semanticsextending a given partial semantics, after discussing what features onewould want such an extension to have. The theorem involves someassumptions about semantical categories in the spirit of Husserl andTarski.
    Download  
     
    Export citation  
     
    Bookmark   72 citations  
  • [Introduction].Wilfrid Hodges - 1988 - Journal of Symbolic Logic 53 (1):1.
    We consider two formalisations of the notion of a compositionalsemantics for a language, and find some equivalent statements in termsof substitutions. We prove a theorem stating necessary and sufficientconditions for the existence of a canonical compositional semanticsextending a given partial semantics, after discussing what features onewould want such an extension to have. The theorem involves someassumptions about semantical categories in the spirit of Husserl andTarski.
    Download  
     
    Export citation  
     
    Bookmark   72 citations  
  • A computably categorical structure whose expansion by a constant has infinite computable dimension.Denis R. Hirschfeldt, Bakhadyr Khoussainov & Richard A. Shore - 2003 - Journal of Symbolic Logic 68 (4):1199-1241.
    Cholak, Goncharov, Khoussainov, and Shore [1] showed that for each k > 0 there is a computably categorical structure whose expansion by a constant has computable dimension k. We show that the same is true with k replaced by ω. Our proof uses a version of Goncharov's method of left and right operations.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Degree spectra of intrinsically C.e. Relations.Denis R. Hirschfeldt - 2001 - Journal of Symbolic Logic 66 (2):441-469.
    We show that for every c.e. degree a > 0 there exists an intrinsically c.e. relation on the domain of a computable structure whose degree spectrum is {0, a}. This result can be extended in two directions. First we show that for every uniformly c.e. collection of sets S there exists an intrinsically c.e. relation on the domain of a computable structure whose degree spectrum is the set of degrees of elements of S. Then we show that if α ∈ (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Computably Categorical Structures and Expansions by Constants.Peter Cholak, Sergey Goncharov, Bakhadyr Khoussainov & Richard Shore - 1999 - Journal of Symbolic Logic 64 (1):13-37.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Computably categorical structures and expansions by constants.Peter Cholak, Sergey Goncharov, Bakhadyr Khoussainov & Richard A. Shore - 1999 - Journal of Symbolic Logic 64 (1):13-37.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Effective model theory vs. recursive model theory.John Chisholm - 1990 - Journal of Symbolic Logic 55 (3):1168-1191.
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • Generic copies of countable structures.Chris Ash, Julia Knight, Mark Manasse & Theodore Slaman - 1989 - Annals of Pure and Applied Logic 42 (3):195-205.
    Download  
     
    Export citation  
     
    Bookmark   42 citations