The following pages link to (Q2703808):
Displaying 50 items.
- Axiomatic (and non-axiomatic) mathematics (Q2080664) (← links)
- First-order logics of evidence and truth with constant and variable domains (Q2084569) (← links)
- Polite combination of algebraic datatypes (Q2090130) (← links)
- Scalable algorithms for abduction via enumerative syntax-guided synthesis (Q2096443) (← links)
- A decision procedure for string to code point conversion (Q2096448) (← links)
- Politeness for the theory of algebraic datatypes (Q2096449) (← links)
- Flexible proof production in an industrial-strength SMT solver (Q2104495) (← links)
- Reasoning about vectors using an SMT theory of sequences (Q2104504) (← links)
- Constructive Ackermann's interpretation (Q2120969) (← links)
- Proof-theory and semantics for a theory of definite descriptions (Q2142067) (← links)
- On the universality of atomic and molecular logics via protologics (Q2169136) (← links)
- Bases for structures and theories. I. (Q2198318) (← links)
- A framework for step-wise explaining how to solve constraint satisfaction problems (Q2238723) (← links)
- Extended fuzzy constructive logic (Q2253863) (← links)
- Logical geometries and information in the square of oppositions (Q2258819) (← links)
- Towards bit-width-independent proofs in SMT solvers (Q2305428) (← links)
- On decidability and axiomatizability of some ordered structures (Q2318170) (← links)
- A logical foundation of arithmetic (Q2350216) (← links)
- On the decidability of axiomatized mereotopological theories (Q2354622) (← links)
- Increasing sentences in simple type theory (Q2363207) (← links)
- Decidability of general extensional mereology (Q2377058) (← links)
- MEBN: a language for first-order Bayesian knowledge bases (Q2389617) (← links)
- Decidable cases of first-order temporal logic with functions (Q2426731) (← links)
- Decision procedures for term algebras with integer constraints (Q2432767) (← links)
- \(\epsilon\)-semantics computations on biological systems (Q2453211) (← links)
- Characterising nested database dependencies by fragments of propositional logic (Q2478548) (← links)
- Reflexive intermediate propositional logics (Q2505130) (← links)
- Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries (Q2631966) (← links)
- Extension and interpretability (Q2658276) (← links)
- The adverbial theory of numbers: some clarifications (Q2690225) (← links)
- The enhanced indispensability argument, the circularity problem, and the interpretability strategy (Q2695151) (← links)
- On Interpolation and Symbol Elimination in Theory Extensions (Q2817926) (← links)
- Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams (Q2818019) (← links)
- Action Theories over Generalized Databases with Equality Constraints (Q2938514) (← links)
- LOGICISM, INTERPRETABILITY, AND KNOWLEDGE OF ARITHMETIC (Q2940868) (← links)
- Satisfiability Modulo Theories (Q3176369) (← links)
- RELATIVE CATEGORICITY AND ABSTRACTION PRINCIPLES (Q3195592) (← links)
- More on Systems of Truth and Predicative Comprehension (Q3295826) (← links)
- Enhancing Symbolic Execution of Heap-Based Programs with Separation Logic for Test Input Generation (Q3297594) (← links)
- Cathoristic Logic (Q3297837) (← links)
- Quantifiers Are Logical Constants, but Only Ambiguously (Q3299519) (← links)
- Parametric Presburger arithmetic: logic, combinatorics, and quasi-polynomial behavior (Q4645009) (← links)
- The lazy logic of partial terms (Q4779651) (← links)
- CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS (Q4959663) (← links)
- FINDING THE LIMIT OF INCOMPLETENESS I (Q4984861) (← links)
- (Q5011276) (← links)
- (Q5011440) (← links)
- (Q5011477) (← links)
- Computation of new diagonal graph Ramsey numbers (Q5054055) (← links)
- ORDER TYPES OF MODELS OF FRAGMENTS OF PEANO ARITHMETIC (Q5085859) (← links)
