The following pages link to (Q3714044):
Displaying 21 items.
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Generalized sketches as a framework for completeness theorems. I-III (Q674480) (← links)
- Simple consequence relations (Q809992) (← links)
- Infinitary logics and 0-1 laws (Q1193591) (← links)
- Dynamic reasoning with qualified syllogisms (Q1402719) (← links)
- Local properties of query languages (Q1575140) (← links)
- Correspondence, canonicity, and model theory for monotonic modal logics (Q2021573) (← links)
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond (Q2117588) (← links)
- A Lindström theorem for intuitionistic propositional logic (Q2176405) (← links)
- A Lindström theorem in many-valued modal logic over a finite MTL-chain (Q2219166) (← links)
- Lindström theorems in graded model theory (Q2220488) (← links)
- Empiricism, probability, and knowledge of arithmetic: a preliminary defense (Q2250551) (← links)
- Burali-Forti as a purely logical paradox (Q2281317) (← links)
- Restricted interpolation over modal logic S4 (Q2342101) (← links)
- Dependence logic with generalized quantifiers: axiomatizations (Q2361348) (← links)
- Omitting uncountable types and the strength of \([0,1]\)-valued logics (Q2442152) (← links)
- A theory of computation based on quantum logic. I (Q2575078) (← links)
- Borel subgroups of Polish groups (Q2576992) (← links)
- TWO-VARIABLE LOGIC HAS WEAK, BUT NOT STRONG, BETH DEFINABILITY (Q5159499) (← links)
- EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES (Q5222519) (← links)
- EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER (Q6095975) (← links)
