Les I-types du système
We prove in this paper that the types of system inhabited uniquely by λI-terms (the I-types) have a positive quantifier. We give also consequences of this result and some examples.
Les modalités de la correction totale
Les types de données syntaxiques du système
Nous présentons dans ce papier une définition purement syntaxique des types entrées et des types sorties du système . Nous définissons les types de données syntaxiques comme étant des types entrées et sorties. Nous démontrons que les types à quantificateurs positifs sont des types de données syntaxiques et qu’un type entrée est un type sortie. Nous imposons des restrictions sur la règle d’élimination des quantificateurs pour démontrer qu’un type sortie est un type entrée.
Les types de données syntaxiques du système
We give in this paper a purely syntactical definition of input and output types of system . We define the syntactical data types as input and output types. We show that any type with positive quantifiers is a syntactical data type and that an input type is an output type. We give some restrictions on the ∀-elimination rule in order to prove that an output type is an input type.
Letter to the editor: Consistency of LPC+Ch
In his paper [Kybernetika 31, No. 1, 99–106 (1995; Zbl 0857.03042)], E. Turunen says in the corollary on p. 106: “Notice that the third last line on page 195 in [J. K. Mattila, “Modifier logic”, in: J. Kacprzyk (ed.) et al., Fuzzy logic for the management of uncertainty. New York: Wiley. 191–209 (1992)] stating that LPC+Ch calculus is consistent is not correct.” The system LPC+Ch is consistent, which can be seen quite trivially.
�?lgebras de Hilbert n-valentes
Liberated versions of T, S4, and S5.
Limits to some interpolation theorems
Local normal forms for first-order logic with applications to games and automata.
Logic and functional programming by retractions
Logical Aggregation Based on Interpolative Boolean Algebra.
Logiche modali con la proprietà del punto fisso
We introduce various kinds of fixed-point properties for modal logics, and we classify the most prominent systems according to these. Our goal is to do a first step towards a complete characterization of provability logics of (possibly non standard) derivability predicates for Peano Arithmetic.
Logics for stable and unstable mereological relations
In this paper we present logics about stable and unstable versions of several well-known relations from mereology: part-of, overlap and underlap. An intuitive semantics is given for the stable and unstable relations, describing them as dynamic counterparts of the base mereological relations. Stable relations are described as ones that always hold, while unstable relations hold sometimes. A set of first-order sentences is provided to serve as axioms for the stable and unstable relations, and representation...
Logics that are both paraconsistent and paracomplete
The Author describes new systems of logic (called "nonalethic") which are both paraconsistent and paracomplete. These systems are connected with the logic of vagueness and with certain philosophical problems (e.g. with some aspects of Hegel's logic).
Logique modale propositionnelle : une vue cavalière
Logique trivalente de Lukasiewicz
Lògiques distributives i booleanes.
Continuing the study of different types of Abstract Logics [5], and following works by Brown-Bloom [1] and Brown-Suszko [2], we analyze in this paper some logics in which, if we identify equivalent formulae by means of the consequence operator, we obtain distributive lattices or Boolean algebras.
-test spaces versus -algebras
In analogy with effect algebras, we introduce the test spaces and -test spaces. A test corresponds to a hypothesis on the propositional system, or, equivalently, to a partition of unity. We show that there is a close correspondence between -algebras and -test spaces.
Many-sorted coalgebraic modal logic : a model-theoretic study
This paper gives a semantical underpinning for a many-sorted modal logic associated with certain dynamical systems, like transition systems, automata or classes in object-oriented languages. These systems will be described as coalgebras of so-called polynomial functors, built up from constants and identities, using products, coproducts and powersets. The semantical account involves Boolean algebras with operators indexed by polynomial functors, called MBAOs, for Many-sorted Boolean Algebras with...
Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study
This paper gives a semantical underpinning for a many-sorted modal logic associated with certain dynamical systems, like transition systems, automata or classes in object-oriented languages. These systems will be described as coalgebras of so-called polynomial functors, built up from constants and identities, using products, coproducts and powersets. The semantical account involves Boolean algebras with operators indexed by polynomial functors, called MBAOs, for Many-sorted Boolean Algebras with...