Skip to main content

Functional Thesauri, Classifying Topoi, Unification, and Flatness

  • Conference paper
  • First Online:
Fields of Logic and Computation III

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 12180))

  • 338 Accesses

Abstract

We describe a part of the theory of classifying topoi and its connections with various topics from computer science, logic, and algebra.

For Yuri Gurevich on the occasion of his eightieth birthday

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Notes

  1. 1.

    We adopt the “logical” convention that a morphism in this category is a natural transformation between the left-adjoint parts \(f^*\) of two geometric morphisms. The “geometric” convention would use the right-adjoint parts instead and would result in a category dual to ours.

  2. 2.

    The additional modifications involved a group action and a probability distribution on the set of “truth values” of the predicates, a set that was not required to contain only “true” and “false”. In our present, functional situation, there are no truth values, and so those modifications are not applicable.

References

  1. Artin, M., Grothendieck, A., Verdier, J.-L.: Théorie des topos et cohomologie étale des schémas. Tome 1: Théorie des topos, Séminaire de Géométrie Algébrique du Bois-Marie 1963–1964 (SGA 4). Springer Lecture Notes in Mathematics, vol. 269. Springer, Heidelberg (1972). https://doi.org/10.1007/BFb0081551

    Book  MATH  Google Scholar 

  2. Blass, A.: Topoi and computation. Bull. Europ. Assoc. Theor. Comp. Sci. 36, 57–65 (1988)

    MATH  Google Scholar 

  3. Blass, A., Gurevich, Y.: Strong extension axioms and Shelah’s zero-one law for choiceless polynomial time. J. Symb. Logic 68, 65–131 (2003)

    Article  MathSciNet  Google Scholar 

  4. Blass, A., Gurevich, Y.: Zero-one laws: Thesauri and parametric conditions. Bull. Europ. Assoc. Theor. Comp. Sci. 91, 125–144 (2007)

    MathSciNet  MATH  Google Scholar 

  5. Blass, A., Ščedrov, A.: Classifying topoi and finite forcing. J. Pure Appl. Algebra 28, 111–140 (1983)

    Article  MathSciNet  Google Scholar 

  6. Church, T., Ellenberg, J., Farb, B.: FI-modules and stability for representations of symmetric groups. Duke Math. J. 164, 1833–1910 (2015). https://arxiv.org/abs/1204.4533

    Article  MathSciNet  Google Scholar 

  7. Diaconescu, R.: Change of base for toposes with generators. J. Pure Appl. Algebra 6, 191–218 (1975)

    Article  MathSciNet  Google Scholar 

  8. Johnstone, P.T.: Topos Theory. Academic Press, Cambridge (1977)

    MATH  Google Scholar 

  9. Lawvere, W.F.: Functorial semantics of algebraic theories. Ph.D. thesis, Columbia University (1963). Reprinted with additional material from the author in Theory and Applications of Categories. http://tac.mta.ca/tac/reprints/articles/5/tr5.pdf

  10. Ščedrov, A.: Forcing and classifying topoi, Mem. Amer. Math. Soc. 48 (1984). #295

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andreas Blass .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Blass, A. (2020). Functional Thesauri, Classifying Topoi, Unification, and Flatness. In: Blass, A., Cégielski, P., Dershowitz, N., Droste, M., Finkbeiner, B. (eds) Fields of Logic and Computation III. Lecture Notes in Computer Science(), vol 12180. Springer, Cham. https://doi.org/10.1007/978-3-030-48006-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-48006-6_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-48005-9

  • Online ISBN: 978-3-030-48006-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics