Home
Hostname: page-component-5cfd469876-d8lm2 Total loading time: 0.255 Render date: 2021-06-24T07:14:07.943Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": true, "newCiteModal": false, "newCitedByModal": true, "newEcommerce": true }

# Sequences of n-diagrams

Published online by Cambridge University Press:  12 March 2014

Corresponding

## Extract

We consider only computable languages, and countable structures, with universe a subset of ω, which we think of as a set of constants. We identify sentences with their Gödel numbers. Thus, for a structure , the complete (elementary) diagram, Dc(), and the atomic diagram, D(), are subsets of ω. We classify formulas as usual. A formula is both Σ0 and Π0 if it is open. For n > 0, a formula, in prenex normal form, is Σn, or Πn, if it has n blocks of like quantifiers, beginning with ∃, or ∀. For a formula θ, in prenex normal form, we let neg(θ) denote the dual formula that is logically equivalent to ¬θ—if θ is Σn, then neg(θ) is Πn, and vice versa.

Type
Research Article
Information
The Journal of Symbolic Logic , September 2002 , pp. 1227 - 1247

## Access options

Get access to the full version of this content by using one of the access options below.

## References

[1]Ash, C., Knight, J., Manasse, M., and Slaman, T., Generic copies of countable structures, Annals of Pure and Applied Logic, vol. 42 (1989), pp. 195205.CrossRefGoogle Scholar
[2]Ash, C. J. and Knight, J. F., Possible degrees in recursive copies II, Annals of Pure and Applied Logic, vol. 87 (1997), pp. 151165.CrossRefGoogle Scholar
[3]Ash, C. J. and Knight, J. F., Computable Structures and the Hyperarithmetical Hierarchy, Elsevier, Amsterdam, 2000.Google Scholar
[4]Barwise, J., Back and forth through infinitary logic, Studies in Model Theory (Morley, M. D., editor), MAA Studies in Mathematics, vol. 8, Mathematical Association of America, Buffalo, New York, 1973, pp. 534.Google Scholar
[5]Chisholm, J., Effective model theory vs. recursive model theory, this Journal, vol. 55 (1990), pp. 11681191.Google Scholar
[6]Chisholm, J. and Moses, M., An undecidable linear order that is n-decidable for all n, Notre Dame Journal of Formal Logic, vol. 39 (1998), pp. 519526.Google Scholar
[7]Goncharov, S. S., Restricted theories of constructive Boolean algebras, Sibirskii Matematicheskii Zhurnal, vol. 17 (1976), pp. 797812, Russian, pp. 601–611 (English translation).Google Scholar
[8]Knight, J. F., Models of arithmetic: quantifiers and complexity, to appear in volume on reverse mathematics (Simpson, S., editor).Google Scholar
[9]Knight, J. F., Sequences of degrees associated with models of arithmetic, to appear in Logic Colloquium 2001.Google Scholar
[10]Knight, J. F., Degrees coded in jumps of orderings, this Journal, vol. 51 (1986), pp. 10341042,Google Scholar
[11]Knight, J. F., Minimality and completions of PA, this Journal, vol. 66 (2001), pp. 14471457.Google Scholar
[12]Moses, M., n-recursive linear orders without (n + 1)-recursive copies, Logical Methods (Crossley, J. N., Remmel, J. B., Shore, R. A., and Sweedler, M. E., editors), BirkhÄuser, Boston, 1993, pp. 572592.CrossRefGoogle Scholar
1
Cited by

# Send article to Kindle

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Sequences of n-diagrams
Available formats
×

# Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Sequences of n-diagrams
Available formats
×

# Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Sequences of n-diagrams
Available formats
×
×