Classifying topoi and finite forcing
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3467077 (Why is no real title available?)
- scientific article; zbMATH DE number 3554471 (Why is no real title available?)
- scientific article; zbMATH DE number 3574077 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- scientific article; zbMATH DE number 3394391 (Why is no real title available?)
- Boolean classifying topoi
- Change of base for toposes with generators
- Completeness results for intuitionistic and modal logic in a categorical setting
- Completing theories by forcing
- Forcing, arithmetic, division rings
- La logique des topos
- Model theory
- Omitting quantifier-free types in generic structures
Cited in
(17)- Annual Meeting of the Association for Symbolic Logic, Berkeley, 1990
- De Morgan classifying toposes
- General affine adjunctions, Nullstellensätze, and dualities
- Atomic toposes and countable categoricity
- Flat vs. filtered colimits in the enriched context
- Flatness, weakly lex colimits, and free exact completions
- The Morita-equivalence between MV-algebras and lattice-ordered abelian groups with strong unit.
- A Brief Introduction to Algebraic Set Theory
- Sheaves of structures, Heyting‐valued structures, and a generalization of Łoś's theorem
- Topological Galois theory
- De Morgan's law and the theory of fields
- Functional Thesauri, Classifying Topoi, Unification, and Flatness
- Seven trees in one
- Functions on universal algebras
- Some aspects of topological Galois theory
- Existential fixed-point logic, universal quantifiers, and topoi
- Boolean classifying topoi
This page was built for publication: Classifying topoi and finite forcing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1052317)
