Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 50 results in range #1 to #50.

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)

  1. Mollusc a general proof-development shell for sequent-based logics: Label: en
  2. Elf: A meta-language for deductive systems: Label: en
  3. Symlog automated advice in Fitch-style proof construction: Label: en
  4. LeanT A P: Lean tableau-based theorem proving: Label: en
  5. KoMeT: Label: en
  6. Combining symbolic computation and theorem proving: Some problems of Ramanujan: Label: en
  7. Problems on the generation of finite models: Label: en
  8. Reconstructing proofs at the assertion level: Label: en
  9. Strongly analytic tableaux for normal modal logics: Label: en
  10. Semantic tableaux with ordering restrictions: Label: en
  11. On pot, pans and pudding or how to discover generalised critical Pairs: Label: en
  12. A completion-based method for mixed universal and rigid E-unification: Label: en
  13. A refined version of general E-unification: Label: en
  14. Theory and practice of minimal modular higher-order E-unification: Label: en
  15. Decidable higher-order unification problems: Label: en
  16. Unification in an extensional lambda calculus with ordered function sorts and constant overloading: Label: en
  17. Tactic theorem proving with refinement-tree proofs and metavariables: Label: en
  18. Exploring abstract algebra in constructive type theory: Label: en
  19. Representing proof transformations for program optimization: Label: en
  20. The complexity of counting problems in equational matching: Label: en
  21. AC-superposition with constraints: No AC-unifiers needed: Label: en
  22. Associative-commutative deduction with constraints: Label: en
  23. Extended path-indexing: Label: en
  24. Proving with BDDs and control of information: Label: en
  25. A novel asynchronous parallelism scheme for first-order logic: Label: en
  26. Termination orderings for rippling: Label: en
  27. Simple termination revisited: Label: en
  28. Ordered chaining for total orderings: Label: en
  29. Str∔ve and integers: Label: en
  30. Mechanically proving geometry theorems using a combination of Wu's method and Collins' method: Label: en
  31. Algebraic factoring and geometry theorem proving: Label: en
  32. A mechanization of strong Kleene logic for partial functions: Label: en
  33. Proof script pragmatics in IMPS: Label: en
  34. On intuitionistic query answering in description bases: Label: en
  35. Bottom-up evaluation of Datalog programs with arithmetic constraints: Label: en
  36. Conservative query normalization on parallel circumscription: Label: en
  37. Primal grammars and unification modulo a binary clause: Label: en
  38. Combination techniques for non-disjoint equational theories: Label: en
  39. The TPTP problem library: Label: en
  40. A mechanically proof-checked encyclopedia of mathematics: Should we build one? Can we?: Label: en
  41. Detecting non-provable goals: Label: en
  42. The applicability of logic program analysis and transformation to theorem proving: Label: en
  43. Semantically guided first-order theorem proving using hyper-linking: Label: en
  44. A new application for explanation-based generalisation within automated deduction: Label: en
  45. On notions of inductive validity for first-order equational clauses: Label: en
  46. A fixedpoint approach to implementing (Co)inductive definitions: Label: en
  47. On the connection between narrowing and proof by consistency: Label: en
  48. Mechanizable inductive proofs for a class of ∀ ∃ formulas: Label: en
  49. Induction using term orderings: Label: en
  50. Model elimination without contrapositives: Label: en

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)