A simple decision procedure for one-variable implicational/negation formulae in intuitionist logic.
نویسندگان
چکیده
منابع مشابه
A Decision Procedure for Herbrand Formulae without Skolemization
This paper describes a decision procedure for disjunctions of conjunctions of anti-prenex normal forms of pure first-order logic (FOLDNFs) that do not contain ∨ within the scope of quantifiers. The disjuncts of these FOLDNFs are equivalent to prenex normal forms whose quantifier-free parts are conjunctions of atomic and negated atomic formulae (= Herbrand formulae). In contrast to the usual alg...
متن کاملDecision procedure for Default Logic
Using a proof-theoretic approach to non-monotone reasoning we introduce an algorithm to compute all extensions of any (propositional) default theory (D, W ) and we also prove correctness of the method. This algorithm is based on a modified analytic tableaux method.
متن کاملYet Another Decision Procedure for Equality Logic
We introduce a new decision procedure for Equality Logic. The procedure improves on Bryant and Velev’s sparse method [4] from CAV’00, in which each equality predicate is encoded with a Boolean variable, and then a set of transitivity constraints are added to compensate for the loss of transitivity of equality. We suggest the Reduced Transitivity Constraints (RTC) algorithm, that unlike the spar...
متن کاملA Decision Procedure for Separation Logic in SMT
This paper presents a complete decision procedure for the entire quantifierfree fragment of Separation Logic (SL) interpreted over heaplets with data elements ranging over a parametric multi-sorted (possibly infinite) domain. The algorithm uses a combination of theories and is used as a specialized solver inside a DPLL(T ) architecture. A prototype was implemented within the CVC4 SMT solver. Pr...
متن کاملEfficient Decision Procedure for a Logic for XML
In this paper, we investigate formal verification techniques to solve decision problems in the world of XML. Such problems can be uniformly modeled by formulas of a modal logic defined on XML trees and having general least and greatest fixpoint operators. This logic, called BTL, can be seen as a variation on alternating-free full μ-calculus. BTL sufficiently captures XPath, a path language for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1962
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093957158