scientific article; zbMATH DE number 3941494
abstract model theoryback-and-forth methodgame quantifiergeneralized quantifiersinfinitary languagesprobability logicsecond-order logictopological logictopological model theory
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Decidability of theories and sets of sentences (03B25) Probability and inductive logic (03B48) Interpolation, preservation, definability (03C40) Properties of classes of models (03C52) Model-theoretic algebra (03C60) Logic on admissible sets (03C70) Logic with extra quantifiers and operators (03C80) Second- and higher-order model theory (03C85) Abstract model theory (03C95)
- Infinitary logics and 0-1 laws
- Dynamic reasoning with qualified syllogisms
- Local properties of query languages
- Correspondence, canonicity, and model theory for monotonic modal logics
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
- A Lindström theorem for intuitionistic propositional logic
- A Lindström theorem in many-valued modal logic over a finite MTL-chain
- Lindström theorems in graded model theory
- Empiricism, probability, and knowledge of arithmetic: a preliminary defense
- Burali-Forti as a purely logical paradox
- Restricted interpolation over modal logic S4
- Dependence logic with generalized quantifiers: axiomatizations
- Omitting uncountable types and the strength of \([0,1]\)-valued logics
- A theory of computation based on quantum logic. I
- Borel subgroups of Polish groups
- Changing a Semantics: Opportunism or Courage?
- scientific article; zbMATH DE number 3928978 (Why is no real title available?)
- Model-Theoretic Logics
- Universality of logic
- TWO-VARIABLE LOGIC HAS WEAK, BUT NOT STRONG, BETH DEFINABILITY
- Existence of modeling limits for sequences of sparse structures
- Finite-Variable Logics Do Not Have Weak Beth Definability Property
- Ordinal compactness
- Algorithmic uses of the Feferman-Vaught theorem
- EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER
- Generalized sketches as a framework for completeness theorems. I-III
- Simple consequence relations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3714044)
