scientific article

No author found.

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

second-order logic probability logic generalized quantifiers infinitary languages abstract model theory topological model theory topological logic back-and-forth method game quantifier

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Probability and inductive logic (03B48) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Decidability of theories and sets of sentences (03B25) Logic with extra quantifiers and operators (03C80) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Second- and higher-order model theory (03C85) Properties of classes of models (03C52) Interpolation, preservation, definability (03C40) Logic on admissible sets (03C70) Abstract model theory (03C95)

Related Items

$\mu$-abstract elementary classes and other generalizations, WHICH CLASSES OF STRUCTURES ARE BOTH PSEUDO-ELEMENTARY AND DEFINABLE BY AN INFINITARY SENTENCE?, LOGICALITY AND MODEL CLASSES, An analog of Beth's theorem in normal extensions of the modal logic K4, On modal logics of model-theoretic relations, On the Ehrenfeucht-Fraïssé game in theoretical computer science, Logical dreams, Generalized quantifiers and pebble games on finite structures, Certain answers as objects and knowledge, Category-based modularisation for equational logic programming, INVARIANCE CRITERIA AS META-CONSTRAINTS, A shared framework for consequence operations and abstract model theory, A general Lindström theorem for some normal modal logics, Ultrafilter translations. I: $(\lambda, \lambda)$-compactness of logics with a cardinality quantifier, Directions in generalized quantifier theory, How to define a linear order on finite models, A FIRST-ORDER FRAMEWORK FOR INQUISITIVE MODAL LOGIC, The countable admissible ordinal equivalence relation, Compactness of ω^λ for λ singular, Algorithmic uses of the Feferman-Vaught theorem, Two applications of topology to model theory, Elementary categorial logic, predicates of variable degree, and theory of quantity, Essential concepts of algebraic specification and program development, Henkin and function quantifiers, Modal ontology and generalized quantifiers, An institution-independent proof of the Robinson consistency theorem, Joint consistency in extensions of the minimal logic, Toward classifying unstable theories, Representing any-time and program-iteration by infinitary conjunction, An introduction to category-based equational logic, Capturing MSO with One Quantifier, Logics of Finite Hankel Rank, Capturing complexity classes with Lindström quantifiers, Unnamed Item, A category equivalence for odd Sugihara monoids and its applications, Maximality of linear continuous logic, The gap‐two cardinal problem for uncountable languages, Keeping logic in the trivium of computer science: a teaching perspective, Axiomatizing AECs and applications, Decidability of the interpolation problem and of related properties in tabular logics, Projective Beth property in extensions of Grzegorczyk logic, Semantics of \textsc{OpenMath} and \textsc{MathML3}, Positive existential definability of parallelism in terms of betweenness in Archimedean ordered affine geometry, Tarski’s Influence on Computer Science, Positive logics, On the number of ${L}_{\infty \omega _1}$-equivalent non-isomorphic models, Interpolation and definability over the logic Gl, CAPTURING CONSEQUENCE, Strong downward Löwenheim-Skolem theorems for stationary logics. I, Structural logic and abstract elementary classes with intersections, Computing on structures, Which Quantifiers Are Logical? A Combined Semantical and Inferential Criterion, LOGICALITY AND MEANING, Distributed Modal Logic, On the expressive power of counting, Computing with infinitary logic, Open texture and mathematics, Algebraization of quantifier logics, an introductory overview, Inner models from extended logics: Part 1, Universal algebra in higher types, Finite-model theory -- A personal perspective, Computable Queries for Object Oriented Databases, Semantic networks, Interpolation and the projective Beth property in well-composed logics, Decidability of the weak interpolation property over the minimal logic, On the logic of informational independence and its applications, Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width, A note on extensions of infinitary logic, Kripke completeness of infinitary predicate multimodal logics, On ultrafilter logic and special functions, Definability and interpolation in non-classical logics, Decidability and Undecidability in Probability Logic, Infinitary logic for computer science, On ultrafilter extensions of first-order models and ultrafilter interpretations, A semantic approach to interpolation, From Choosing Elements to Choosing Concepts: The Evolution of Feferman’s Work in Model Theory, The many faces of interpolation, Harmonious logic: Craig's interpolation theorem and its descendants, On simplicity of formulas, Strict monadic topology. I: First separation axioms and reflections, Craig Interpolation for Linear Temporal Languages, Chain logic and Shelah's infinitary logic, From Hilbert's program to a logic tool box, AN EXPOSITION OF THE COMPACTNESS OF, Definability hierarchies of generalized quantifiers, Computational empiricism, Epimorphisms in cylindric algebras and definability in finite variable logic, A Simple Construction of Robinson Equivalence Relations, Completeness and interpolation of almost-everywhere quantification over finitely additive measures, Intuitionistic logic and implicit definability, Topological queries in spatial databases, Positive results in abstract model theory: a theory of compact logics, Propositional dynamic logic with local assignments, Ordinal compactness, Modal logics and varieties of modal algebras: The Beth properties, interpolation, and amalgamation, Definability properties and the congruence closure, Expressiveness of concept expressions in first-order description logics, Some thoughts on computational models: from massive human computing to abstract state machines, and beyond, Interpolation and the Robinson property for logics not closed under the Boolean operations, Nice infinitary logics, Games and Lindström theorems, Logics capturing relativized complexity classes uniformly, A Lindström theorem for intuitionistic first-order logic, MAXIMALITY OF LOGIC WITHOUT IDENTITY, Corrected iteration, INTERLEAVING LOGIC AND COUNTING, Logic, logics, and logicism