Related papers: Some Closed Classes of Three-Valued Logic Generate…
Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…
We consider the rational linear relations between real numbers whose squared trigonometric functions have rational values, angles we call ``geodetic''. We construct a convenient basis for the vector space over Q generated by these angles.…
In this paper (propositional) probability logic ($PL$) is investigated from model theoretic point of view. First of all, the ultraproduct construction is adapted for $\sigma$-additive probability models, and subsequently when this class of…
Multivalued linear operators, also known as linear relations, are studied on a specific class of weighted, composition transforms on Fock space. Basic properties of this class of linear relations, such as closed graph, boundedness, complex…
Motivated by the classical work of Halmos on functional monadic Boolean algebras we derive three basic sup-semilattice constructions, among other things the so-called powersets and powerset operators. Such constructions are extremely useful…
We clarify the structure of nilpotent Lie groups which are multiplication groups of $3$-dimensional simply connected topological loops and prove that non-solvable Lie groups acting minimally on $3$-dimensional manifolds cannot be the…
It has recently been discovered that both quantum and classical propositional logics can be modelled by classes of non-orthomodular and thus non-distributive lattices that properly contain standard orthomodular and Boolean classes,…
Clarithmetics are number theories based on computability logic (see http://www.csc.villanova.edu/~japaridz/CL/ ). Formulas of these theories represent interactive computational problems, and their "truth" is understood as existence of an…
Weak Kleene logics are three-valued logics characterized by the presence of an infectious truth-value. In their external versions, as they were originally introduced by Bochvar and Hallden, these systems are equipped with an additional…
We introduce and study logic programs whose clauses are built out of monotone constraint atoms. We show that the operational concept of the one-step provability operator generalizes to programs with monotone constraint atoms, but the…
To each isolated critical point of a smooth function on a 3-manifold we put in correspondence a tree (graph without cycles). We will prove that functions are topologically equivalent in the neighborhoods of critical points if and only if…
Clarithmetics are number theories based on computability logic (see http://www.csc.villanova.edu/~japaridz/CL/ ). Formulas of these theories represent interactive computational problems, and their "truth" is understood as existence of an…
The notions Golodness and tightness for simplicial complexes come from algebra and geometry, respectively. We prove these two notions are equivalent for 3-manifold triangulations, through a topological characterization of a polyhedral…
For each $n\in\mathbb{N}$, let $[n]\phi$ mean "the sentence $\phi$ is true in all $\Sigma_{n+1}$-correct transitive sets." Assuming G\"odel's axiom $V = L$, we prove the following graded variant of Solovay's completeness theorem: the set of…
A logic family is a bunch of logics that belong together in some way. First-order logic is one of the examples. Logics organized into a structure occurs in abstract model theory, institution theory and in algebraic logic. Logic families…
In this paper, we describe geometrical constructions to obtain triangulations of connected sums of closed orientable triangulated 3-manifolds. Using these constructions, we show that it takes time polynomial in the number of tetrahedra to…
The following numerical control over the topological equivalence is proved: two complex polynomials in $n\not= 3$ variables and with isolated singularities are topologically equivalent if one deforms into the other by a continuous family of…
We study ruled submanifolds of Euclidean space. First, to each (parametrized) ruled submanifold $\sigma$, we associate an integer-valued function, called degree, measuring the extent to which $\sigma$ fails to be cylindrical. In particular,…
Predicate logic is the premier choice for specifying classes of relational structures. Homomorphisms are key to describing correspondences between relational structures. Questions concerning the interdependencies between these two means of…
Semigroups generated by topological operations such as closure, interior or boundary are considered. It is noted that some of these semigroups are in general finite and noncommutative. The problem is formulated whether they are always…