On Extensions of Elementary Logic
From MaRDI portal
Cited in
(65)- The many faces of interpolation
- Harmonious logic: Craig's interpolation theorem and its descendants
- The Craig interpolation theorem in abstract model theory
- A note on syntactical and semantical functions
- Interpolation and definability in abstract logics
- The old and the new logic of metascience
- Carnap's work in the foundations of logic and mathematics in a historical perspective
- Accelerating tableaux proofs using compact representations
- Definability and automorphisms in abstract logics
- A note on extensions of infinitary logic
- First-order modal logic: frame definability and a Lindström theorem
- Definability hierarchies of generalized quantifiers
- Generalized quantifiers and pebble games on finite structures
- Chain logic and Shelah's infinitary logic
- A logic-based approach to incremental reasoning on multi-agent systems
- On representations of intended structures in foundational theories
- Paraconsistent metatheory: new proofs with old tools
- 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
- On compactness of logics that can express properties of symmetry or connectivity
- A general Lindström theorem for some normal modal logics
- Omitting uncountable types and the strength of \([0,1]\)-valued logics
- Two applications of topology to model theory
- Positive logics
- An extension of the Ehrenfeucht-Fraïssé game for first order logics augmented with Lindström quantifiers
- Logics of finite Hankel rank
- Maximal Logics
- On Löwenheim-Skolem-Tarski numbers for extensions of first order logic
- Bi-simulating in bi-intuitionistic logic
- Extensions of countable infinitary logic which preserve most of its nice properties
- Duality Between Logics and Equivalence Relations
- On orderings of the family of all logics
- Knowledge representation, the world wide web, and the evolution of logic
- Generalized Quantifiers and Compact Logic
- Compact and ϖ-compact formulas in 51-151-151-1
- Generalized compactness of nonmonotonic inference operations
- LOGICALITY AND MODEL CLASSES
- First order data types and first order logic
- Inner models from extended logics. I
- Propositional team logics
- Algorithmic uses of the Feferman-Vaught theorem
- Games and Lindström theorems
- Abstract categorical logic
- A Lindström theorem for intuitionistic first-order logic
- Preservation in many-valued truth institutions
- MAXIMALITY OF LOGIC WITHOUT IDENTITY
- Compactness in team semantics
- Craig interpolation for decidable first-order fragments
- Putnam's model-theoretic argument (meta)reconstructed. In the mirror of Carpintero's and van Douven's interpretations
- A modular bisimulation characterisation for fragments of hybrid logic
- The completeness theorem? So what!
- Craig interpolation for decidable first-order fragments
- Lindström's characterizability of abstract logic systems for analytic structures based on measures
- Cofinality quantifiers in abstract elementary classes and beyond
- Logics from ultrafilters
- First-order friendliness
- On equivalence relations between interpreted languages, with an application to modal and first-order language
- My writing
- Characterizing data dependencies then and now
- First-order logic with equicardinality in random graphs
- Carnap's (categoricity) problem
- On the model theory of second-order objects
- A Lindström theorem for the hybrid logic \(\mathcal{H}(\exists)\)
- From IF to BI. A tale of dependence and separation
This page was built for publication: On Extensions of Elementary Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5606559)