Logic and functional programming by retractions
Logic and -recognizable sets of integers.
Logic and the foundations of mathematics in Lvov (1900-1939)
Logical Aggregation Based on Interpolative Boolean Algebra.
Logical cover spaces
Logically orientated cluster analysis
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).
Logics with separating sets of measures
Logics With two Types of Integral Operators
Logics with two types of integral operators.
Logika od A do G. Návrh matematikova mechanického pomocníka volně zpracovaný tvůrčím matematikem
Logique, catégories et faisceaux
Logique de la géométrie algébrique
Logique mathématique et analyse non-standard
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.
Long chains in Rudin-Frolík order