Related papers: On terms describing omitting types 1 and 2 - an im…

An algorithm to decide the emptiness of a regular type expression with set operators given a set of parameterised type definitions is presented. The algorithm can also be used to decide the equivalence of two regular type expressions and…

We construct six unitary trace invariants for 2 by 2 quaternionic matrices which separate the unitary similarity classes of such matrices, and show that this set is minimal. We prove two quaternionic versions of a well known…

We introduce a new two-sided type system for verifying the correctness and incorrectness of functional programs with atoms and pattern matching. A key idea in the work is that types should range over sets of normal forms, rather than sets…

We investigate the theory of finite observables, i.e., resolutions of the finite-dimensional identity by means of positive operators, that have a physical interpretation in terms of measurement schemes. We focus on extremal and rank-one…

We determine the endomorphism categories of cell 2-representations of fiat 2-categories associated with strongly regular two-sided cells under some natural assumptions. Along the way, we completely describe J-simple fiat 2-categories which…

We prove completeness, interpolation and omitting types for certain predicate topological logics that properly extend the first order case. We aslo count the non isomorphic topological models of a countable theory

Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof…

This is the first installment of an exposition of an ACL2 formalization of elementary linear algebra, focusing on aspects of the subject that apply to matrices over an arbitrary commutative ring with identity, in anticipation of a future…

There have been increasing challenges to dual-system descriptions of System-1 and System-2, critiquing them as imprecise and fostering misconceptions. We address these issues here by way of Dennett's appeal to use computational thinking as…

We study infinite ternary words that contain few distinct palindromes. In particular, we classify such words according to their critical exponent.

In a paper by the first author it was shown that for certain arithmetical results on conjugacy class sizes it is enough to only consider the vanishing conjugacy class sizes. In this paper we further weaken the conditions to consider only…

Logically constrained term rewriting is a rewriting framework that supports built-in data structures such as integers and bit vectors. Recently, constrained terms play a key role in various analyses and applications of logically constrained…

We consider the maximal p-norm associated with a completely positive map and the question of its multiplicativity under tensor products. We give a condition under which this multiplicativity holds when p = 2, and we describe some maps which…

Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for LF in the style of recent formulations where only canonical…

We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms…

A two-dimensional string is simply a two-dimensional array. We continue the study of the combinatorial properties of repetitions in such strings over the binary alphabet, namely the number of distinct tandems, distinct quartics, and runs.…

Hybrid logic extends modal logic with special propositions called nominals, each of which is true at only one state in a model. This enables us to describe some properties of binary relations, such as irreflexivity and anti-symmetry, which…

We revise the enumeration of the imprimitive rank two quaternionic reflection groups, adding missing groups and establishing isomorphisms between groups in the published tables. The isomorphisms are obtained as a consequence of the…

We show that many bounded rationality patterns of choice can be alternatively represented as testable models of limited consideration, and we elicit the features of the associated unobserved consideration sets from the observed choice.…

This paper introduces a simple type system for combinatory logic in which combinators have at most one type, whose polymorphism is revealed by application. The combinatory types exactly describe the structure of their values, which may be…