Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Fundamenta Informaticae

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Intersection Types and Termination Properties

Koletsos G.

Fundamenta Informaticae

2012

Vol. 121, nr 1/4

185-202

We use the system of intersection types and the type assignment method to prove termination properties in λ-calculus. In the first part we deal with conservation properties. We give a type assignment proof of the classical conservation theorem for λI calculus and then we extend this method to the notion of the reduction β_I and β_S of de Groote [9]. We also give a direct type assignment proof of the extended conservation property according to which if a term is βI , βS- normalizable then it is β-strongly normalizable. We further extend the conservation theorem by introducing the notion of β-normal form. In the second part we prove that if Ω is not a substring of a λ-term M then M can be typed in the Krivine's system D of intersection types. In that way we obtain a type assignment proof of the Sorensen’s Ω-theorem.

Many-valued modal non-monotonic reasoning: sequential stable sets and logics with linear truth spaces

Koutras C.D., Koletsos G., Zachos S.

Fundamenta Informaticae

1999

Vol. 38, Nr 3

281-324

A family of many-valued modal logics which correspond to possible-worlds models with many-valued accessibility relations, has been recently proposed by M. Fitting. Non-monotonic extensions of these logics are introduced with a fixpoint construction a la McDermott & Doyle and employ sequential belief sets as epistemic states. In this paper we take a logical investigation of many-valued modal non-monotonic reasoning in Fitting's formal framework. We examine the notion of MV-stable sets which emerges as a sequential many-valued analog of Stalnaker-Moore stable sets and prove that several attractive epistemic properties are essentially retained in the many-valued setting, esp. when focusing on a syntactically simple epistemic fragment of MV-stable sets. We show that MV-stable sets are always closed under S4 consequence and identify three sufficient conditions for capturing axioms of negative introspection. Also, the relation of MV-stable sets to many-valued analogs of classical S5 models and to many-valued extensions of universal models is discussed. Finally, we pay special attention to the subclass of logics built on linear Heyting algebras and show that inside this subclass, the situation is very similar - in many respects - to the machinery devised by W. Marek, G. Schwarz and M. Truszczyński. In particular, the normal fragments of the two important classical ranges of modal non-monotonic logics remain intact: many-valued autoepistemic logic is captured by any non-monotonic logic in K5-KD45 and many-valued reflexive autoepistemic logic corresponds to KTw5-Sw5.