The following pages link to ETPS (Q18433):
Displayed 50 items.
- The structure of generalized intermediate syllogisms (Q279323) (← links)
- The higher-order prover \textsc{Leo}-II (Q287283) (← links)
- Syllogisms and 5-square of opposition with intermediate quantifiers in fuzzy natural logic (Q346769) (← links)
- On good EQ-algebras (Q409738) (← links)
- Reasoning about mathematical fuzzy logic and its future (Q419039) (← links)
- A formal theory of generalized intermediate syllogisms (Q423141) (← links)
- Monotonicity inference for higher-order formulas (Q438558) (← links)
- On theorem prover-based testing (Q470025) (← links)
- Carnap's early semantics (Q486945) (← links)
- Combining and automating classical and non-classical logics in classical higher-order logics (Q656826) (← links)
- Unification algorithms for eliminating and introducing quantifiers in natural deduction automated theorem proving (Q679252) (← links)
- A functional partial semantics for intensional logic (Q689211) (← links)
- Elements of model theory in higher-order fuzzy logic (Q695272) (← links)
- On fuzzy type theory (Q703370) (← links)
- PNL to HOL: from the logic of nominal sets to the logic of higher-order functions (Q714797) (← links)
- A formal theory of intermediate quantifiers (Q835126) (← links)
- A comprehensive theory of trichotomous evaluative linguistic expressions (Q835271) (← links)
- Proving fairness and implementation correctness of a microkernel scheduler (Q835766) (← links)
- Probabilistic modelling, inference and learning using logical theories (Q841641) (← links)
- Logical structure of fuzzy IF-THEN rules (Q853465) (← links)
- TPS: A hybrid automatic-interactive system for developing proofs (Q865629) (← links)
- What's right with a syntactic approach to theories and models? (Q907910) (← links)
- On connections and higher-order logic (Q908896) (← links)
- Integrating predicate transition nets with first order temporal logic in the specification and verification of concurrent systems (Q916414) (← links)
- Rigid E-unification: NP-completeness and applications to equational matings (Q921913) (← links)
- The seven virtues of simple type theory (Q946569) (← links)
- Combined reasoning by automated cooperation (Q946572) (← links)
- Partial and nested recursive function definitions in higher-order logic (Q972425) (← links)
- Abstract deduction and inferential models for type theory (Q988551) (← links)
- Engineering and theoretical underpinnings of retrenchment (Q997238) (← links)
- An extensible encoding of object-oriented data models in HOL. With an application to IMP++ (Q1040775) (← links)
- EQ-algebras (Q1043290) (← links)
- A second order theory of data types (Q1092657) (← links)
- Instantiation theory. On the foundations of automated deduction (Q1202066) (← links)
- Universal abstract consistency class and universal refutation (Q1288438) (← links)
- Experimenting with Isabelle in ZF set theory (Q1312157) (← links)
- Combinatory reduction systems: Introduction and survey (Q1314356) (← links)
- A simple type theory with partial functions and subtypes (Q1314643) (← links)
- IMPS: An interactive mathematical proof system (Q1319391) (← links)
- A semantics for \(\lambda \)Prolog (Q1349686) (← links)
- Using tactics to reformulate formulae for resolution theorem proving (Q1380410) (← links)
- Non-commutative first-order EQ-logics (Q1697347) (← links)
- Carnap's early metatheory: scope and limits (Q1708750) (← links)
- Incorporating quotation and evaluation into Church's type theory (Q1753993) (← links)
- Quantum number theory (Q1770337) (← links)
- The foundation of a generic theorem prover (Q1823013) (← links)
- Higher-order unification revisited: Complete sets of transformations (Q1823936) (← links)
- Higher order unification via explicit substitutions (Q1854337) (← links)
- Computing verisimilitude (Q1903577) (← links)
- Theorem proving with analytic tableaux and related methods. 5th international workshop, TABLEAUX '96, Terrasini, Palermo, Italy, May 15--17, 1996. Proceedings (Q1913544) (← links)