Truth Values Algebras and Proof Normalization

نویسنده

Gilles Dowek

چکیده

We extend the notion of Heyting algebra to a notion of truth values algebra and prove that a theory is consistent if and only if it has a B-valued model for some non trivial truth values algebra B. A theory that has a B-valued model for all truth values algebras B is said to be super-consistent. We prove that super-consistency is a model-theoretic sufficient condition for strong normalization.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simplicial normalization in the entire cyclic cohomology of Banach algebras

We show that the entire cyclic cohomology of Banach algebras defined by Connes has the simplicial normalization property. A key tool in the proof is the notion and properties of supertraces on the Cuntz algebra QA. As an example of further applications of this technique we give a proof of the homotopy invariance of entire cyclic cohomology.

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

Categorical Foundations of Quantum Logics and Their Truth Values Structures

We introduce a foundational sheaf theoretical scheme for the comprehension of quantum event structures, in terms of localization systems consisting of Boolean coordinatization coverings induced by measurement. The scheme is based on the existence of a categorical adjunction between presheaves of Boolean event algebras and Quantum event algebras. On the basis of this adjoint correspondence we pr...

متن کامل

On completeness of reducibility candidates as a semantics of strong normalization

This paper defines a sound and complete semantic criterion, based on reducibility candidates, for strong normalization of theories expressed in minimal deduction modulo à la Curry. The use of Curry-style proof-terms allows to build this criterion on the classic notion of pre-Heyting algebras and makes that criterion concern all theories expressed in minimal deduction modulo. Compared to using C...

متن کامل