Related papers: The Common Knowledge of Formula Exclusion

It is shown that the lattices of flats of boolean representable simplicial complexes are always atomistic, but semimodular if and only if the complex is a matroid. A canonical construction is introduced for arbitrary finite atomistic…

We address the fact that composition in an opetopic weak n-category is in general not unique and hence is not a well-defined operation. We define composition with a given k-cell in an n-category by a span of (n-k)-categories. We…

After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference…

We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…

Fine's influential Canonicity Theorem states that if a modal logic is determined by a first-order definable class of Kripke frames, then it is valid in its canonical frames. This article reviews the background and context of this result,…

Let $X$ be a simply connected path connected topological space which is formal in the sense of rational homotopy theory. Let $Y=X\cup_\alpha\mathbb{D}^{n}$ where $\alpha:\mathbb{S}^{n-1}\to X$ is a non-torsion element. Then we obtain a…

In this article, we consider the factor complexity of a fixed point of a primitive substitution canonically defined by a beta-numeration system. We provide a necessary and sufficient condition on the Renyi expansion of 1 for having an…

Using Hilbert-Burch matrices, we give an explicit description of the Bia{\l}ynicki-Birula cells on the Hilbert scheme of points on $\mathbb A ^2$ with isolated fixed points. If the fixed point locus is positive dimensional we obtain an…

We review and possibly add some new variant to the existing derivations of the formula for the area of Jordan lattice polygons drawn on two-dimensional lattices. The formula is known as Pick's theorem and is related to the number theory…

Let $G$ be a finite non-abelian group and $\kappa_1(G)$ the number of conjugate classes of minimal non-abelian subgroups of $G$. The structure of $G$ with $\kappa_1(G)=1$ is determined. In the case of $G$ being the $p$-groups, the structure…

A recently proposed axiom system for Andr\'e's central translation structures is improved upon. First, one of its axioms turns out to be dependent (derivable from the other axioms). Without this axiom, the axiom system is indeed…

The Lambek calculus can be considered as a version of non-commutative intuitionistic linear logic. One of the interesting features of the Lambek calculus is the so-called "Lambek's restriction," that is, the antecedent of any provable…

We develop a conceptually clear, intuitive, and feasible decision procedure for testing satisfiability in the full multi-agent epistemic logic CMAEL(CD) with operators for common and distributed knowledge for all coalitions of agents…

In this paper we complete the description of the $B\mathbb{Z} /p$-cellularization of the classifying spaces of all finite groups, for all primes $p$. The techniques are based in a careful analysis of the $p$-fusion structure of the groups…

We propose to use Tarski's least fixpoint theorem as a basis to define recursive functions in the calculus of inductive constructions. This widens the class of functions that can be modeled in type-theory based theorem proving tool to…

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

All possible products of all elements of an odd order finite group are considered. A set of all such products is called as a K-set. A hypothesis of K-set coincidence of any group of an odd order with its commutant is proposed and the…

Epistemic logics typically talk about knowledge of individual agents or groups of explicitly listed agents. Often, however, one wishes to express knowledge of groups of agents specified by a given property, as in `it is common knowledge…

The main purpose of this article is to extend some of the ideas from Schubert calculus to the more general setting of Hamiltonian torus actions on compact symplectic manifolds with isolated fixed points. Given a generic component of the…

Using the properties of the ideal of the coordinate Hermite interpolation on n-dimensional grid [4], we prove that the extension k in k[x1, x2, ..., xn] / (f1(x1), ..., fn(xn)) has a primitive element if and only if at most one of the…