Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen.
Bemerkung zu Gurevich's Arbeit über das Entscheidungsproblem für Standardklassen.
Beta-reduction as unification
We define a new unification problem, which we call β-unification and which can be used to characterize the β-strong normalization of terms in the λ-calculus. We prove the undecidability of β-unification, its connection with the system of intersection types, and several of its basic properties.
Between logic and probability.
Logic and Probability, as theories, have been developed quite independently and, with a few exceptions (like Boole's), have largely ignored each other. And nevertheless they share a lot of similarities, as well a considerable common ground. The exploration of the shared concepts and their mathematical treatment and unification is here attempted following the lead of illustrious researchers (Reichenbach, Carnap, Popper, Gaifman, Scott & Krauss, Fenstad, Miller, David Lewis, Stalnaker, Hintikka...
Between Tw→ and Rw→
Bibliographie commentée
Bidual Spaces and Reflexivity of Real Normed Spaces
In this article, we considered bidual spaces and reflexivity of real normed spaces. At first we proved some corollaries applying Hahn-Banach theorem and showed related theorems. In the second section, we proved the norm of dual spaces and defined the natural mapping, from real normed spaces to bidual spaces. We also proved some properties of this mapping. Next, we defined real normed space of R, real number spaces as real normed spaces and proved related theorems. We can regard linear functionals...
Binary consistent choice on pairs and a generalization of Konig's infinity lemma
Binary Relations-based Rough Sets – an Automated Approach
Rough sets, developed by Zdzisław Pawlak [12], are an important tool to describe the state of incomplete or partially unknown information. In this article, which is essentially the continuation of [8], we try to give the characterization of approximation operators in terms of ordinary properties of underlying relations (some of them, as serial and mediate relations, were not available in the Mizar Mathematical Library [11]). Here we drop the classical equivalence- and tolerance-based models of rough...
BL-algebras and quantum structures
BL-algebras of basic fuzzy logic.
BL-algebras [Hajek] rise as Lindenbaum algebras from certain logical axioms familiar in fuzzy logic framework. BL-algebras are studied by means of deductive systems and co-annihilators. Duals of many theorems known to hold in MV-algebra theory remain valid for BL-algebras, too.
Boolean part of BL-algebras
Bounded dually residuated lattice ordered monoids as a generalization of fuzzy structures
Bounded statements in the theory of algebraically closed fields with distinguished automophisms.
Brouwer Invariance of Domain Theorem
In this article we focus on a special case of the Brouwer invariance of domain theorem. Let us A, B be a subsets of εn, and f : A → B be a homeomorphic. We prove that, if A is closed then f transform the boundary of A to the boundary of B; and if B is closed then f transform the interior of A to the interior of B. These two cases are sufficient to prove the topological invariance of dimension, which is used to prove basic properties of the n-dimensional manifolds, and also to prove basic properties...
BUDI: Architecture for Fuzzy Search in Documental Repositories.
Calcolo dei predicati e concetti metateorici in una teoria base dei fondamenti della Matematica
I primi elementi della sintassi e della semantica del Calcolo dei Predicati del primo ordine (predicati, proposizioni, formule, interpretazioni, ecc.) sono introdotti nell'ambiente delle teorie base dei Fondamenti della Matematica di [11]. Il problema della verità e falsità delle proposizioni è affontato introducendo, a fianco delle ordinarie qualità , , che non possono valutare tutte le proposizioni (Teorema 1), nuovi «oggetti metateorici», le metaqualità , che, indipendenti dalle relazioni...
Calcul des séquents et déduction naturelle pour la logique trivalente de Lukasiewicz
Categorical, functorial and algebraic aspects of the type-free lambda calculus
Categorical Pullbacks
The main purpose of this article is to introduce the categorical concept of pullback in Mizar. In the first part of this article we redefine homsets, monomorphisms, epimorpshisms and isomorphisms [7] within a free-object category [1] and it is shown there that ordinal numbers can be considered as categories. Then the pullback is introduced in terms of its universal property and the Pullback Lemma is formalized [15]. In the last part of the article we formalize the pullback of functors [14] and it...