Journal of Symbolic Logic 68 (1):319-351 (2003)
|Abstract||We settle a number of questions concerning definability in first order logic with an extra predicate symbol ranging over semi-linear sets. We give new results both on the positive and negative side: we show that in first-order logic one cannot query a semi-linear set as to whether or not it contains a line, or whether or not it contains the line segment between two given points. However, we show that some of these queries become definable if one makes small restrictions on the semi-linear sets considered|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Dev K. Roy & Richard Watnick (1988). Finite Condensations of Recursive Linear Orders. Studia Logica 47 (4):311 - 317.
Vicky Dierckx & Andr (2003). Is Model Construction Open to Strategic Decisions? An Exploration in the Field of Linear Reasoning. Thinking and Reasoning 9 (2):97 – 131.
Peter W. O'Hearn & David J. Pym (1999). The Logic of Bunched Implications. Bulletin of Symbolic Logic 5 (2):215-244.
Christopher Potts, Rajesh Bhatt, Joe Pater & Michael Becker, Harmonic Grammar with Linear Programming: From Linear Systems to Linguistic Typology.
Vladimir Kanovei (1996). On External Scott Algebras in Nonstandard Models of Peano Arithmetic. Journal of Symbolic Logic 61 (2):586-607.
Nguyen Cat Ho & Helena Rasiowa (1987). Semi-Post Algebras. Studia Logica 46 (2):149 - 160.
Oleg Belegradek (2004). Semi-Bounded Relations in Ordered Modules. Journal of Symbolic Logic 69 (2):499 - 517.
Lauri Hella (1996). Logical Hierarchies in PTIME. Information and Computation 129 (1):1--19.
Carl G. Jockusch Jr & James C. Owings Jr (1990). Weakly Semirecursive Sets. Journal of Symbolic Logic 55 (2):637-644.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #291,771 of 722,871 )
Recent downloads (6 months)1 ( #60,917 of 722,871 )
How can I increase my downloads?