scientific article; zbMATH DE number 3941493
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)
- A semantic approach to interpolation
- The many faces of interpolation
- Harmonious logic: Craig's interpolation theorem and its descendants
- From Hilbert's program to a logic tool box
- Epimorphisms in cylindric algebras and definability in finite variable logic
- Propositional dynamic logic with local assignments
- Interpolation and the Robinson property for logics not closed under the Boolean operations
- Elementary extensions of topological models in \(L_ t\) language
- Elementary categorial logic, predicates of variable degree, and theory of quantity
- Henkin and function quantifiers
- Algebraization of quantifier logics, an introductory overview
- Universal algebra in higher types
- Semantic networks
- EM constructions for a class of generalized quantifiers
- On the logic of informational independence and its applications
- Topological queries in spatial databases
- Modal logics and varieties of modal algebras: The Beth properties, interpolation, and amalgamation
- How to define a linear order on finite models
- Essential concepts of algebraic specification and program development
- Computational empiricism
- Intuitionistic logic and implicit definability
- Expressiveness of concept expressions in first-order description logics
- Keeping logic in the trivium of computer science: a teaching perspective
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
- A note on extensions of infinitary logic
- On ultrafilter logic and special functions
- Definability hierarchies of generalized quantifiers
- Generalized quantifiers and pebble games on finite structures
- Category-based modularisation for equational logic programming
- Ultrafilter translations. I: (, )-compactness of logics with a cardinality quantifier
- Directions in generalized quantifier theory
- Toward classifying unstable theories
- A category equivalence for odd Sugihara monoids and its applications
- Semantics of \textsc{OpenMath} and \textsc{MathML3}
- Open texture and mathematics
- On ultrafilter extensions of first-order models and ultrafilter interpretations
- Chain logic and Shelah's infinitary logic
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
- Strong downward Löwenheim-Skolem theorems for stationary logics. I
- Strict monadic topology. I: First separation axioms and reflections
- An analog of Beth's theorem in normal extensions of the modal logic K4
- A shared framework for consequence operations and abstract model theory
- A general Lindström theorem for some normal modal logics
- The countable admissible ordinal equivalence relation
- Projective Beth property in extensions of Grzegorczyk logic
- Definability and interpolation in non-classical logics
- Certain answers as objects and knowledge
- Two applications of topology to model theory
- Axiomatizing AECs and applications
- Positive logics
- On the number of \(L_{\infty\omega_1}\)-equivalent non-isomorphic models
- \(\mu\)-abstract elementary classes and other generalizations
- Completeness and interpolation of almost-everywhere quantification over finitely additive measures
- Nice infinitary logics
- Compactness of ^ for singular
- Capturing MSO with one quantifier
- Logics of finite Hankel rank
- Which quantifiers are logical? A combined semantical and inferential criterion
- Distributed modal logic
- Duality for Compact Logics and Substitution in Abstract Model Theory
- Decidability and Undecidability in Probability Logic
- Craig Interpolation for Linear Temporal Languages
- scientific article; zbMATH DE number 3928978 (Why is no real title available?)
- A generalization of abstract model theory
- Modal ontology and generalized quantifiers
- A Simple Construction of Robinson Equivalence Relations
- scientific article; zbMATH DE number 48549 (Why is no real title available?)
- scientific article; zbMATH DE number 51820 (Why is no real title available?)
- Decidability of the interpolation problem and of related properties in tabular logics
- scientific article; zbMATH DE number 1163949 (Why is no real title available?)
- Model-Theoretic Logics
- Representing any-time and program-iteration by infinitary conjunction
- Tarski's influence on computer science
- Computing on structures
- Logicality and meaning
- Barwise: Abstract Model Theory and Generalized Quantifiers
- Logical dreams
- scientific article; zbMATH DE number 764208 (Why is no real title available?)
- Computable queries for object oriented databases
- AN EXPOSITION OF THE COMPACTNESS OF
- scientific article; zbMATH DE number 7350772 (Why is no real title available?)
- LOGICALITY AND MODEL CLASSES
- On the Ehrenfeucht-Fraïssé game in theoretical computer science (extended abstract)
- Invariance criteria as meta-constraints
- A first-order framework for inquisitive modal logic
- An introduction to category-based equational logic
- Capturing complexity classes with Lindström quantifiers
- Maximality of linear continuous logic
- The gap-two cardinal problem for uncountable languages
- Inner models from extended logics. I
- Infinitary logic for computer science
- From choosing elements to choosing concepts: the evolution of Feferman's work in model theory
- CAPTURING CONSEQUENCE
- Structural logic and abstract elementary classes with intersections
- Ordinal compactness
- WHICH CLASSES OF STRUCTURES ARE BOTH PSEUDO-ELEMENTARY AND DEFINABLE BY AN INFINITARY SENTENCE?
- Logic, logics, and logicism
- Algorithmic uses of the Feferman-Vaught theorem
- Games and Lindström theorems
- Joint consistency in extensions of the minimal 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 Q3714043)