Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
ETPS - MaRDI portal

ETPS

From MaRDI portal
Software:18433



swMATH6302MaRDI QIDQ18433


No author found.





Related Items (only showing first 100 items - show all)

$n$-fold obstinate and $n$-fold fantastic (pre)filters of $EQ$-algebrasUnnamed ItemRewriting, and equational unification: the higher-order casesFrom Classical to Fuzzy Type TheoryA Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple UnificationUnnamed ItemDependent ML An approach to practical programming with dependent typesA Proof-theoretic Analysis of Goal-directed ProvabilityHigher-order semantics and extensionalityUnnamed ItemModal Sequent Calculi Labelled with Truth Values: Completeness, Duality and AnalyticityUnnamed ItemTheorem proving using equational matings and rigid E -unificationRECONSTRUCTION OF G. SPENCER BROWN'S THEMEGraded Generalized Hexagon in Fuzzy Natural LogicA Formal Definition for the Expressive Power of Terminological Knowledge Representation LanguagesA Hoare Logic for Call-by-Value Functional ProgramsIdentity, equality, nameability and completeness. Part IIUnnamed ItemFluted formulas and the limits of decidabilityHigher-Order Tarski Grothendieck as a Foundation for Formal Proof.The Structure of Differential Invariants and Differential Cut EliminationA Nominal Axiomatization of the Lambda CalculusA logical framework combining model and proof theoryAutomated Termination Analysis for Programs with Second-Order RecursionUnnamed ItemUnnamed ItemOn sets, types, fixed points, and checkerboardsUnnamed ItemFrontiers of Combining SystemsUnnamed ItemUnnamed ItemAlonzo church:his life, his work and some of his miraclesUnnamed ItemTest-Sequence Generation with Hol-TestGen with an Application to Firewall TestingA Theory of System Interaction: Components, Interfaces, and ServicesAutomated Synthesis of Induction Axioms for Programs with Second-Order RecursionUnnamed ItemUnnamed ItemMathematical Fuzzy Logic in Modeling of Natural Language SemanticsA partial functions version of Church's simple theory of typesMBase: Representing knowledge and context for the integration of mathematical software systemsUnnamed ItemExtending Sledgehammer with SMT SolversEvaluation of anonymity and confidentiality protocols using theorem provingUnnamed ItemRecent Trends in Algebraic Development TechniquesUnnamed ItemTheorem Proving in Higher Order LogicsTheorem Proving in Higher Order LogicsOn General Properties of Intermediate QuantifiersSupra-logic: using transfinite type theory with type variables for paraconsistencyCombining Theories with Shared Set OperationsAlgebraic Methodology and Software TechnologyUnnamed ItemMathematical Knowledge ManagementUnnamed ItemIntegral prefilters and integral EQ-algebrasEQ-algebra-based fuzzy type theory and its extensionsThe structure of generalized intermediate syllogismsTheory morphisms in Church's type theory with quotation and evaluationThe higher-order prover \textsc{Leo}-IIA formal theory of intermediate quantifiersA comprehensive theory of trichotomous evaluative linguistic expressionsProving fairness and implementation correctness of a microkernel schedulerA second order theory of data typesProbabilistic modelling, inference and learning using logical theoriesCombining Model Checking and DeductionA Bit of History Related to Logic Based on EqualityA semantics for \(\lambda \)PrologHOL Light: An OverviewUnnamed ItemUnnamed ItemUnnamed ItemParametric Church's thesis: synthetic computability without choiceLogical structure of fuzzy IF-THEN rulesUnnamed ItemComputing verisimilitudeProbabilistic reasoning in a classical logicSemantics, calculi, and analysis for object-oriented specificationsGLIVENKO AND KURODA FOR SIMPLE TYPE THEORYSyllogisms and 5-square of opposition with intermediate quantifiers in fuzzy natural logicTPS: A hybrid automatic-interactive system for developing proofsTheorem proving with analytic tableaux and related methods. 5th international workshop, TABLEAUX '96, Terrasini, Palermo, Italy, May 15--17, 1996. ProceedingsUnnamed ItemUsing tactics to reformulate formulae for resolution theorem provingTPS: A theorem-proving system for classical type theoryDecidability of fluted logic with identityOn good EQ-algebrasReasoning about mathematical fuzzy logic and its futureNon-commutative first-order EQ-logicsA formal theory of generalized intermediate syllogismsQuantified multimodal logics in simple type theoryWhat's right with a syntactic approach to theories and models?On connections and higher-order logicMonotonicity inference for higher-order formulasCarnap's early metatheory: scope and limitsIntegrating predicate transition nets with first order temporal logic in the specification and verification of concurrent systemsGrammar induction by unification of type-logical lexiconsRigid E-unification: NP-completeness and applications to equational matings


This page was built for software: ETPS