Related papers: Non-tightness in class theory and second-order ari…
We find necessary and sufficient conditions for gauge invariance of the action of Double Field Theory (DFT) as well as closure of the algebra of gauge symmetries. The so-called weak and strong constraints are sufficient to satisfy them, but…
Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation \beta, and a quaternary equidistance relation \equiv. Tarski established, inter alia, that the first-order…
In this article I first give an abbreviated history of string theory and then describe the recently-conjectured field-string duality. This suggests a class of nonsupersymmetric gauge theories which are conformal (CGT) to leading order of…
Generalized topological spaces are not necessarily closed under finite intersections. Moreover, the whole universe does not need to be open. We use modified version of this framework to establish certain models for non-normal modal logics.…
We perform the Hamiltonian analysis of non-linear massive gravity action studied recently in arXiv:1106.3344 [hep-th]. We show that the Hamiltonian constraint is the second class constraint. As a result the theory possesses an odd number of…
This note is about the relationship between two theories of negation as failure -- one based on program completion, the other based on stable models, or answer sets. Francois Fages showed that if a logic program satisfies a certain…
We consider fragments of uniform reflection for formulas in the analytic hierarchy over theories of second order arithmetic. The main result is that for any second order arithmetic theory $T_0$ extending ${\sf RCA}_0$ and axiomatizable by a…
The paper is devoted to modal properties of the ternary strict betweenness relation as used in the development of various systems of geometry. We show that such a relation is non-definable in a basic similarity type with a binary operator…
We show that we can interpret concatenation theories in arithmetical theories without coding sequences.
In recent years, researchers have discovered various large algebraic structures that have surprising finiteness properties, such as FI-modules and Delta-modules. In this paper, we add another example to the growing list: we show that…
I shall describe a general model-theoretic task to construct expansions of pseudofinite structures and discuss several examples of particular relevance to computational complexity. Then I will present one specific situation where finding a…
This review is based on two lectures given at the 2000 TMR school in Torino. We discuss two main themes: i) Moyal-type deformations of gauge theories, as emerging from M-theory and open string theories, and ii) the noncommutative geometry…
In terms of non-commutative geometry, we show that the $\sigma$--model can be built up by the gauge theory on discrete group $Z_2$. We introduce a constraint in the gauge theory, which lead to the constraint imposed on linear $\sigma$ model…
In this article we undertake a study of extension complexity from the perspective of formal languages. We define a natural way to associate a family of polytopes with binary languages. This allows us to define the notion of extension…
Compactness is one of the core notions of analysis: it connects local properties to global ones and makes limits well-behaved. We study the computational properties of the compactness of Cantor space $2^{\mathbb{N}}$ for uncountable covers.…
It was recently shown by Atserias, Buss and Mueller that the standard complexity-theoretic conjecture NEXP not in P / poly is consistent with the relatively strong bounded arithmetic theory V^0_2, which can prove a substantial part of…
We generalise various theorems for finding indiscernible trees and arrays to positive logic: based on an existing modelling theorem for s-trees, we prove modelling theorems for str-trees, str$_0$-trees (the reduct of str-trees that forgets…
The classical counterpart of noncommutative quantum mechanics is a constrained system containing only second class constraints. The embedding procedure formulated by Batalin, Fradkin and Tyutin (BFT) enables one to transform this system…
In this work, we present a brief but insightful overview of the gauge theories, which are defined on $ n $-dimensional lattices by using finite gauge groups, in order to show how they can be interpreted as a Hamiltonian system with…
For a commutative noetherian ring A, we compare the support of a complex of A-modules with the support of its cohomology. This leads to a classification of all full subcategories of A-modules which are thick (that is, closed under taking…