scientific article; zbMATH DE number 3085803
From MaRDI portal
Publication:5824680
Cited in
(71)- The many faces of interpolation
- The road to two theorems of logic
- Harmonious logic: Craig's interpolation theorem and its descendants
- Epimorphisms in cylindric algebras and definability in finite variable logic
- Der Interpolationssatz der intuitionistischen Prädikatenlogik
- On the theory of biased bisection operations and their inverses
- Definability and commonsense reasoning
- Intuitionistic logic and implicit definability
- Multicomponent proof-theoretic method for proving interpolation properties
- Definability, decidability, complexity
- Frege's new science
- On Gabbay's proof of the Craig interpolation theorem for intuitionistic predicate logic
- The decidability of Craig's interpolation property in well-composed J-logics
- Explicit definitions of implicitly definable objects in some modal logics
- Beth definability and the Stone-Weierstrass theorem
- Generalised graded interpolation
- Algorithms for recognizing restricted interpolation over the modal logic S4
- A note on constructive interpolation for the multi-modal logic \(K_m\)
- Epimorphism surjectivity in varieties of Heyting algebras
- Epimorphisms in varieties of subidempotent residuated structures
- The institution-theoretic scope of logic theorems
- Craig interpolation in the presence of unreliable connectives
- Definability for model counting
- Restricted interpolation over modal logic S4
- An analog of Beth's theorem in normal extensions of the modal logic K4
- On propositional definability
- Epimorphisms in varieties of residuated structures
- Projective Beth property in extensions of Grzegorczyk logic
- Classification of extensions of the modal logic S4
- Definability and interpolation in non-classical logics
- Amalgamation, congruence-extension, and interpolation properties in algebras
- On the vicious circle in definitions
- Definibility in normal theories
- Exact query reformulation with first-order ontologies and databases
- Implicit definitions, second-order quantifiers, and the robustness of the logical operators
- On enumerating query plans using analytic tableau
- ExpTime tableaux for \(\mathcal {ALC}\) using sound global caching
- Decidability of the interpolation problem and of related properties in tabular logics
- Andrzej Mostowski and the notion of a model
- SOME MODEL THEORY OF GUARDED NEGATION
- Sets and functions in theoretical physics
- Recursive definitions and fixed-points
- From choosing elements to choosing concepts: the evolution of Feferman's work in model theory
- Beth definability, interpolation and language splitting
- Some new results in definability
- On Automorphisms of Polyadic Algebras
- On a generalization of a theorem of E. W. Beth
- A logical look at characterizations of geometric transformations under mild hypotheses
- A list of arithmetical structures complete with respect to the first-order definability
- Algorithmic uses of the Feferman-Vaught theorem
- The lattice of definability: origins, recent developments, and further directions
- Ramsification and the ramifications of Prior's puzzle
- Boosting definability bipartition computation using SAT witnesses
- Recursive definitions and fixed-points on well-founded structures
- Generalized implicit definitions on finite structures
- Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory
- Machine-checked meta-theory of dual-tableaux for intuitionistic logic
- Special cases of the interpolation theorem for classical predicate calculus
- Some special cases of the interpolation theorem for intuitionistic predicate calculus
- Failure of Beth's theorem in relevance logics
- Interpolation and the projective Beth property in well-composed logics
- On the completeness of interpolation algorithms
- Two interpolation theorems
- Synthesizing strongly equivalent logic programs: Beth definability for answer set programs via Craig interpolation in first-order logic
- Exponential lower bounds on definable fixed points
- On the fragility of interpolation
- On nondefinability of interior-connectedness via the contact relation
- Completeness of interpolation algorithms in classical and non-classical logics
- Amalgamation, interpolation, and implicit definability in varieties of algebras
- Some problems concerning language and physics
- Definability theorems in normal extensions of the provability 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 Q5824680)