Possible-worlds semantics for rule-based expert systems with set-valued weights
Power Series Solutions of Algebraic Differential Equations.
Prädikatenlogik mit partiell definierten Funktionen.
Prädikatenlogik mit partiell definierten Funktionen II.
Pre-adjunctions and lambda-algebraic theories
Preboolean MV-algebras as bipartite MV-algebras.
In this note we characterize bipartite MV-algebras by introducing the notion of preboolean MV-algebras.
Precomplete classes of operations on an uncountable set
Predicate calculus and naive set theory in pure combinatory logic.
Predicate calculus of arbitrarily high finite order.
Preface to the special volume: “Chu spaces: theory and applications".
Prefix classes of Krom formulae with identity.
Preliminaries to Classical First Order Model Theory
First of a series of articles laying down the bases for classical first order model theory. These articles introduce a framework for treating arbitrary languages with equality. This framework is kept as generic and modular as possible: both the language and the derivation rule are introduced as a type, rather than a fixed functor; definitions and results regarding syntax, semantics, interpretations and sequent derivation rules, respectively, are confined to separate articles, to mark out the hierarchy...
Présentation de la logique combinatoire en vue de ses applications
Presentation of Natural Deduction
Preservation of admissibility of inference rules in the logics similar to S4. 2.
Preservation Theorems for Limits of Structures and Global Sections of Sheaves of Structures.
Priestley dualities for some lattice-ordered algebraic structures, including MTL, IMTL and MV-algebras
In this work we give a duality for many classes of lattice ordered algebras, as Integral Commutative Distributive Residuated Lattices MTL-algebras, IMTL-algebras and MV-algebras (see page 604). These dualities are obtained by restricting the duality given by the second author for DLFI-algebras by means of Priestley spaces with ternary relations (see [2]). We translate the equations that define some known subvarieties of DLFI-algebras to relational conditions in the associated DLFI-space.
Prime Factorization of Sums and Differences of Two Like Powers
Representation of a non zero integer as a signed product of primes is unique similarly to its representations in various types of positional notations [4], [3]. The study focuses on counting the prime factors of integers in the form of sums or differences of two equal powers (thus being represented by 1 and a series of zeroes in respective digital bases). Although the introduced theorems are not particularly important, they provide a couple of shortcuts useful for integer factorization, which could...
Prime Filters and Ideals in Distributive Lattices
The article continues the formalization of the lattice theory (as structures with two binary operations, not in terms of ordering relations). In the Mizar Mathematical Library, there are some attempts to formalize prime ideals and filters; one series of articles written as decoding [9] proven some results; we tried however to follow [21], [12], and [13]. All three were devoted to the Stone representation theorem [18] for Boolean or Heyting lattices. The main aim of the present article was to bridge...
Probabilistic operational semantics for the lambda calculus
Probabilistic operational semantics for a nondeterministic extension of pure λ-calculus is studied. In this semantics, a term evaluates to a (finite or infinite) distribution of values. Small-step and big-step semantics, inductively and coinductively defined, are given. Moreover, small-step and big-step semantics are shown to produce identical outcomes, both in call-by-value and in call-by-name. Plotkin’s CPS translation is extended to accommodate the choice operator and shown correct with respect...