Gödel-Dummett Counter-models through Matrix Computation
نویسنده
چکیده
We present a new method for deciding Gödel-Dummett logic. Starting from a formula, it proceeds in three steps. First build a conditional graph based on the decomposition tree of the formula. Then try to remove some cycles in this graph by instantiating these boolean conditions. In case this is possible, extract a countermodel from such an instance graph. Otherwise the initial formula is provable. We emphasize on cycle removal through matrix computation, boolean constraint solving and counter-model extraction.
منابع مشابه
Combining Proof-Search and Counter-Model Construction for Deciding Gödel-Dummett Logic
We present an algorithm for deciding Gödel-Dummett logic. The originality of this algorithm comes from the combination of proofsearch in sequent calculus, which reduces a sequent to a set of pseudoatomic sequents, and counter-model construction of such pseudo-atomic sequents by a fixpoint computation. From an analysis of this construction, we deduce a new logical rule [⊃N ] which provides short...
متن کاملCounter-Model Search in Gödel-Dummett Logics
We present a new method for deciding Gödel-Dummett logic LC. We first characterize the validity of irreducible sequents of LC by the existence of r-cycles in bi-colored graphs and we propose a linear algorithm to detect r-cycles and build counter-models. Then we characterize the validity of formulae by the existence of r-cycles in boolean constrained graphs. We also give a parallel method to de...
متن کاملBounding Resource Consumption with Gödel-Dummett Logics
Gödel-Dummett logic LC and its finite approximations LCn are the intermediate logics complete w.r.t. linearly ordered Kripke models. In this paper, we use LCn logics as a tool to bound resource consumption in some process calculi. We introduce a non-deterministic process calculus where the consumption of a particular resource denoted • is explicit and provide an operational semantics which meas...
متن کاملA Lambda Calculus for Gödel-Dummett Logic Capturing Waitfreedom
We propose a typed lambda calculus based on Avron’s hypersequent calculus for Gödel–Dummett logic. This calculus turns out to model waitfree computation. Besides strong normalization and nonabortfullness, we give soundness and completeness of the calculus against the typed version of waitfree protocols. The calculus is not only proof theoretically interesting, but also valuable as a basis for d...
متن کاملTranslating Labels to Hypersequents for Intermediate Logics with Geometric Kripke Semantics
We give a procedure for translating geometric Kripke frame axioms into structural hypersequent rules for the corresponding intermediate logics in Int/Geo that admit weakening, contraction and in some cases, cut. We give a procedure for translating labelled sequents in the corresponding logic to hypersequents that share the same linear models (which correspond to Gödel-Dummett logic). We prove t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 125 شماره
صفحات -
تاریخ انتشار 2005