Journal of Symbolic Logic 44 (4):583-598 (1979)

An infinitary characterisation of the first-order sentences true in all substructures of a structure M is used to obtain partial reduction of the decision problem for such sentences to that for Th(M). For the relational structure $\langle\mathbf{R}, \leq, +\rangle$ this gives a decision procedure for the ∃ x∀ y-part of the theory of all substructures, yet we show that the ∃ x 1x 2 ∀ y-part, and the entire theory, is Π 1 1 -complete. The theory of all ordered subsemigroups of $\langle\mathbf{R}, \leq, +\rangle$ is also shown Π 1 1 -complete. Applications in the philosophy of science are mentioned
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2273297
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,172
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles


Added to PP index

Total views
46 ( #247,900 of 2,517,885 )

Recent downloads (6 months)
1 ( #409,045 of 2,517,885 )

How can I increase my downloads?


My notes