Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
From MaRDI portal
Publication:2547549
Cited in
(only showing first 100 items - show all)- Categoricity of computable infinitary theories
- Harmonious logic: Craig's interpolation theorem and its descendants
- The Craig interpolation theorem in abstract model theory
- Complete existentially closed locally finite groups
- Gruppenuniversalität und Homogenisierbarkeit
- A completeness proof for adapted probability logic
- Hyperfinite models of adapted probability logic
- Stability of recursive structures in arithmetical degrees
- Infinitary propositional normal modal logic
- Categoricity results for \(L_{\infty \kappa}\)-free algebras
- Applications of Fodor's lemma to Vaught's conjecture
- Sacks forcing does not always produce a minimal upper bound
- Proving total correctness of nondeterministic programs in infinitary logic
- Definability in dynamic logic
- Existenziell abgeschlossene lokal endliche p-Gruppen
- Uncountable degree spectra
- The theory of A-spaces
- A minimal prime model with an infinite set of indiscernibles
- A formal analogy between Baer subplanes and their complements
- More Lowenheim-Skolem results for admissible sets
- Categoricity in \(\aleph_1\) of sentences in \(L_{\omega_1\omega}(Q)\)
- Espaces de Baire et espaces de probabilité de structures rélationnelles
- Elementary extensions of Levy's model of A^-_2
- Finiteness is mu-ineffable
- Uncountable universal locally finite groups
- Consistency property and model existence theorem for second order negative languages with conjunctions and quantifications over sets of cardinality smaller than a strong limit cardinal of denumerable cofinality
- Model theory via set theory
- Robinson forcing is not absolute
- Properties, propositions and sets
- New axiomatizations for logics with generalized quantifiers
- The Hanf number for classes of algebras whose largest congruence is always finitely generated
- Borel equivalence relations induced by actions of the symmetric group
- Proof methods for reasoning about possibility and necessity
- Inseparability in recursive copies
- A typed logic of partial functions reconstructed classically
- Measuring the classification difficulty of countable torsion-free Abelian groups.
- Ranks and pregeometries in finite diagrams
- On institutions for modular coalgebraic specifications.
- Arrovian aggregation of generalised expected-utility preferences: (im)possibility results by means of model theory
- A formalized general theory of syntax with bindings
- A strong failure of \(\aleph _0\)-stability for atomic classes
- Scott sentences for certain groups
- Hanf number for Scott sentences of computable structures
- Models of set theory with definable ordinals
- Orbit cardinals: On the effective cardinalities arising as quotient spaces of the form X/G where G acts on a Polish space X
- Some applications of positive formulas in descriptive set theory and logic
- Key notions of Tarski's methodology of deductive systems
- Categoricity in hyperarithmetical degrees
- Observational logic, constructor-based logic, and their duality.
- A contextual-hierarchical approach to truth and the liar paradox
- Generalized quantifiers and pebble games on finite structures
- Logic of transition systems
- Some applications of illfoundedness
- The nonabsoluteness of model existence in uncountable cardinals for \(L_{\omega_{1},\omega}\)
- Design of abstract domains using first-order logic
- A formalized general theory of syntax with bindings: extended version
- Martin's maximum\(^{++}\) implies Woodin's axiom \((*)\)
- Possible predicates and actual properties
- Infinite monochromatic paths and a theorem of Erdős-Hajnal-Rado
- Model theoretic characterizations of large cardinals
- Kurepa trees and spectra of \(\mathcal{L}_{\omega_1, \omega}\)-sentences
- Lindström theorems in graded model theory
- Encoding complete metric structures by classical structures
- Empiricism, probability, and knowledge of arithmetic: a preliminary defense
- On transferring model theoretic theorems of \(\mathcal L_{\infty,\omega}\) in the category of sets to a fixed Grothendieck topos
- Notes on cardinals that are characterizable by a complete (Scott) sentence
- More on looping vs. repeating in dynamic logic
- Completeness theorems for \(\sigma \)-additive probabilistic semantics
- Scott sentences for equivalence structures
- Completeness theorem for probability models with finitely many valued measure
- Computable categoricity for pseudo-exponential fields of _1
- On order types of linear basic algebras.
- Shelah's eventual categoricity conjecture in universal classes. I.
- Simplicity and uncountable categoricity in excellent classes
- Constructor-based observational logic
- An example related to Gregory's theorem
- Game logic and its applications. I
- Enumerations in computable structure theory
- Abstract elementary classes stable in \(\aleph_{0}\)
- Two applications of topology to model theory
- Local collection and end-extensions of models of compositional truth
- Three red herrings around Vaught's conjecture
- Completeness and interpolation of almost-everywhere quantification over finitely additive measures
- The stability spectrum for classes of atomic models
- Forcing a countable structure to belong to the ground model
- Computable structures in generic extensions
- Persistently Finite, Persistently Arithmetic Theories
- Beginning of stability theory for Polish spaces
- Biprobability logic with conditional expectation
- A robuster Scott rank
- Glimm-Effros for coanalytic equivalence relations
- The consistency property in lattice valued model theory for infinitary logic
- Undefinable Classes and Definable Elements in Models of Set Theory and Arithmetic
- Omitting types for infinitary \([0,1]\)-valued logic
- scientific article; zbMATH DE number 3664914 (Why is no real title available?)
- Topological model theory with an interior operator: Consistency properties and back — and forth arguments
- Extended ultrapowers and the Vopěnka-Hrbáček theorem without choice
- Hamiltonian closure on universal algebras.
- Omitting Types: Application to Descriptive Set Theory
- The Theory of Countable Analytical Sets
This page was built for publication: Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2547549)
