Rasiowa introduced logic systems called “Approximation Logics”. In these systems a set of constants constitutes a fundamental tool. In this papers, we consider logic systems called L ′T without this kind of constants but limited to the case where T is a finite poset. We prove a weak ...
Rasiowa introduced logic systems called “Approximation Logics”. In these systems a set of constants constitutes a fundamental tool. In this papers, we consider logic systems called L ′ T without this kind of constants but limited to the case where T is a finite poset. We prove a weak ...
We introduce in this paper a Kripke-style semantics for a subsystem of for which there existes a deduction theorem. The set of “possible worldsr is enriched by a family of functions indexed by the elements of T and satisfying some conditions. We prove a completeness result for system wit...