scientific article; zbMATH DE number 3941494
zbMATH Open0587.03002MaRDI QIDQ3714044FDOQ3714044
Authors:
Publication date: 1985
Title of this publication is not available (Why is that?)
generalized quantifierssecond-order logicinfinitary languagesprobability logicabstract model theorytopological model theorytopological logicback-and-forth methodgame quantifier
Probability and inductive logic (03B48) 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) Model-theoretic algebra (03C60) Logic with extra quantifiers and operators (03C80) Decidability of theories and sets of sentences (03B25) Abstract model theory (03C95) Properties of classes of models (03C52) Interpolation, preservation, definability (03C40) Second- and higher-order model theory (03C85) Logic on admissible sets (03C70)
Cited In (27)
- Infinitary logics and 0-1 laws
- EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER
- Local properties of query languages
- Algorithmic uses of the Feferman-Vaught theorem
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
- Omitting uncountable types and the strength of \([0,1]\)-valued logics
- Title not available (Why is that?)
- Correspondence, canonicity, and model theory for monotonic modal logics
- Empiricism, probability, and knowledge of arithmetic: a preliminary defense
- Dependence logic with generalized quantifiers: axiomatizations
- Generalized sketches as a framework for completeness theorems. I-III
- Dynamic reasoning with qualified syllogisms
- Simple consequence relations
- TWO-VARIABLE LOGIC HAS WEAK, BUT NOT STRONG, BETH DEFINABILITY
- A Lindström theorem for intuitionistic propositional logic
- Model-Theoretic Logics
- Burali-Forti as a purely logical paradox
- A theory of computation based on quantum logic. I
- Restricted interpolation over modal logic S4
- Finite-Variable Logics Do Not Have Weak Beth Definability Property
- Borel subgroups of Polish groups
- Ordinal compactness
- A Lindström theorem in many-valued modal logic over a finite MTL-chain
- Lindström theorems in graded model theory
- Changing a Semantics: Opportunism or Courage?
- Existence of modeling limits for sequences of sparse structures
- Universality of logic
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)
