Skip to main content

Some decision problems for subtheories of two-dimensional partial orderings

  • 290 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 859)

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.95
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Church, A. and Quine, W. V., Some theorems on definability and decidability, J. of Symbolic Logic 17 (1952), 179–187.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Dushnik, B. and Miller, E. W., Partially ordered sets, Amer. J. of Math. 63 (1941), 600–610.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. Läuchli, H. and Leonard, J., On the elementary theory of linear order, Fundamenta Mathematicae 59 (1966), 109–116.

    MathSciNet  MATH  Google Scholar 

  4. Manaster, A. B. and Remmel, J. B., Partial orderings of fixed finite dimension: model companions and density, J. of Symbolic Logic (to appear).

    Google Scholar 

  5. _____, Some recursion theoretic aspects of dense two-dimensional partial orderings, to appear in "Aspects of Effective Algebra: Proceedings of a mini-conference, Monash University, 1979", Upside-Down A Book Co., Melbourne, Australia.

    Google Scholar 

  6. _____, Recursively categorical decidable dense planar orderings, (in preparation).

    Google Scholar 

  7. Manaster, A. B. and Rosenstein, J. G., Two-dimensional partial orderings: recursive model theory, J. of Symbolic Logic 45 (1980), 121–132.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. _____, Two-dimensional partial orderings: undecidability, J. of Symbolic Logic 45 (1980), 133–143.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. Metakides, G. and Remmel, J. B., Recursion theory on orderings, I: a model theoretic setting, J. of Symbolic Logic 44 (1979), 383–402.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. Rabin, M. O., A simple method for undecidability proofs and some applications, Logic, Methodology, and Philosophy of Science (Proceedings 1964 International Congress), North-Holland, Amsterdam (1965), 58–68.

    Google Scholar 

  11. Remmel, J. B., Recursion theory on orderings II, J. of Symbolic Logic 45 (1980), 317–333.

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. Rogers, H. J. Jr., Logical reduction and decision problems, Annals of Mathematics 64 (1956), 264–284.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Manaster, A.B., Remmel, J.B. (1981). Some decision problems for subtheories of two-dimensional partial orderings. In: Lerman, M., Schmerl, J.H., Soare, R.I. (eds) Logic Year 1979–80. Lecture Notes in Mathematics, vol 859. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0090948

Download citation

  • DOI: https://doi.org/10.1007/BFb0090948

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10708-8

  • Online ISBN: 978-3-540-38673-5

  • eBook Packages: Springer Book Archive