Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Completeness theorem

From MaRDI portal
(Redirected from Software:40276)
Jump to:navigation, search



swMATH28562MaRDI QIDQ40276FDOQ40276


Author name not available (Why is that?)

Official website: https://www.isa-afp.org/entries/Completeness.html




Cited In (25)

  • Formalization of the resolution calculus for first-order logic
  • Self-formalisation of higher-order logic. Semantics, soundness, and a verified implementation
  • Soundness and completeness proofs by coinductive methods
  • A verified SAT solver framework with learn, forget, restart, and incrementality
  • Formalization of the Resolution Calculus for First-Order Logic
  • MUSCADET
  • PVSio
  • IsaFoL
  • DPT
  • Abstract Completeness
  • FOL Fitting
  • Abstract Soundness
  • Incompleteness Theorems
  • Paraconsistency
  • NASA PVS
  • Propositional Resolution
  • SAT Solver Verification
  • Superposition Calculus
  • Verified Prover
  • FOL_Harrison
  • PyRes
  • Programming and verifying a declarative first-order prover in Isabelle/HOL
  • Formally verified tableau-based reasoners for a description logic
  • Unified Classical Logic Completeness
  • Epistemic Logic


This page was built for software: Completeness theorem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Completeness_theorem&oldid=56370885"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 13 March 2026, at 07:16. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki