A fixed-point theorem for Horn formula equations
From MaRDI portal
Publication:6647303
DOI10.4204/EPTCS.344.5MaRDI QIDQ6647303
Stefan Hetzl, Johannes Kloibhofer
Publication date: 3 December 2024
Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Affine relationships among variables of a program
- Computing circumscription revisited: A reduction algorithm
- The Boolean solution problem from the perspective of predicate logic
- Boolean unification - the story so far
- Untersuchungen über das Eliminationsproblem der mathematischen Logik
- Inductive theorem proving based on tree grammars
- A mathematical introduction to logic.
- Horn Clause Solvers for Program Verification
- The Semantics of Predicate Logic as a Programming Language
- Some Fixed Point Basics
- Fixed Point Logics
- Decidability of affine solution problems
- Completeness in the theory of types
- Das Auflösungsproblem in der Klassenlogik
- Das Auflösungsproblem in der Klassenlogik
This page was built for publication: A fixed-point theorem for Horn formula equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6647303)
