English
Related papers

Related papers: Bilinear spaces over a fixed field are simple unst…

200 papers

We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our…

Logic in Computer Science · Computer Science 2012-10-10 Jakub Michaliszyn , Jan Otop , Piotr Witkowski

We explore finite-field frameworks for quantum theory and quantum computation. The simplest theory, defined over unrestricted finite fields, is unnaturally strong. A second framework employs only finite fields with no solution to x^2+1=0,…

Quantum Physics · Physics 2015-06-15 Andrew J. Hanson , Gerardo Ortiz , Amr Sabry , Yu-Tsung Tai

This paper is a study of first-order coherent logic from the point of view of duality and categorical logic. We prove a duality theorem between coherent hyperdoctrines and open polyadic Priestley spaces, which we subsequently apply to prove…

Logic · Mathematics 2024-06-21 Sam van Gool , Jérémie Marquès

Logical frameworks provide natural and direct ways of specifying and reasoning within deductive systems. The logical framework LF and subsequent developments focus on finitary proof systems, making the formalization of circular proof…

Logic in Computer Science · Computer Science 2023-05-11 Zhibo Chen , Frank Pfenning

The superselection sectors of two classes of scalar bilocal quantum fields in D>=4 dimensions are explicitly determined by working out the constraints imposed by unitarity. The resulting classification in terms of the dual of the respective…

Mathematical Physics · Physics 2008-11-26 Bojko Bakalov , Nikolay Nikolov , Karl-Henning Rehren , Ivan Todorov

It is well-known that extending the Hilbert axiomatic system for first-order intuitionistic logic with an exclusion operator, that is dual to implication, collapses the domains of models into a constant domain. This makes it an interesting…

Logic in Computer Science · Computer Science 2024-11-20 Tim S. Lyon , Ian Shillito , Alwen Tiu

The geometrical structure known as the Tulczyjew triple has proved to be very useful in describing mechanical systems, even those with singular Lagrangians or subject to constraints. Starting from basic concepts of variational calculus, we…

Differential Geometry · Mathematics 2015-05-30 Katarzyna Grabowska

This work can be thought as a contribution to the model theory of group extensions. We study the groups G which are interpretable in the disjoint union of two structures (seen as a two-sorted structure). We show that if one of the two…

Logic · Mathematics 2013-04-05 Alessandro Berarducci , Marcello Mamino

In this paper we prove undecidability of finite systems of equations in free Lie algebras of rank at least three over an arbitrary field. We show that the ring of integers $\mathbb{Z}$ is interpretable by positive existential formulas in…

Logic · Mathematics 2017-08-25 Olga Kharlampovich , Alexei Myasnikov

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

Logic in Computer Science · Computer Science 2023-06-22 Bruno Courcelle

In this paper, we develop a representation-theoretic formulation of discrete-time linear systems. We show that such systems are naturally viewed as representations of time groups acting on vector spaces, thereby endowing the state space…

Systems and Control · Electrical Eng. & Systems 2026-04-13 Subhrajit Sinha

Orthogonality is a notion based on the duality between programs and their environments used to determine when they can be safely combined. For instance, it is a powerful tool to establish termination properties in classical formal systems.…

Logic in Computer Science · Computer Science 2024-02-14 Marcelo Fiore , Zeinab Galal , Farzad Jafarrahmani

The paper deals with two issues: the existence of universal models of a theory T and related properties when cardinal arithmetic does not give this existence offhand. In the first section we prove that simple theories (e.g., theories…

Logic · Mathematics 2008-02-03 Saharon Shelah

We note a parallel between some ideas of stable model theory and certain topics in finite combinatorics related to the sum-product phenomenon. For a simple linear group G, we show that a finite subset X with |X X \^{-1} X |/ |X| bounded is…

Logic · Mathematics 2011-05-17 Ehud Hrushovski

We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory…

Logic · Mathematics 2013-12-25 Saharon Shelah

We introduce notions of stationarily ordered types and theories; the latter generalizes weak o-minimality and the first is a relaxed version of weak o-minimality localized at the locus of a single type. We show that forking, as a binary…

Logic · Mathematics 2019-12-19 Slavko Moconja , Predrag Tanović

This manuscript addresses the analysis and design of feedback laws for the stabilization of bilinear control systems in infinite-dimensional spaces. It first examines weak, strong, and polynomial stabilization within a Hilbert space…

Optimization and Control · Mathematics 2026-04-15 Mohamed Ouzahra

Orthogonal spaces are vector spaces together with a quadratic form whose associated bilinear form is non-degenerate. Over fields of characteristic two, there are many quadratic forms associated to a given bilinear form and quadratic…

Logic · Mathematics 2024-08-20 Charlotte Kestner , Nicholas Ramsey

Hybrid logic with binders is an expressive specification language. Its satisfiability problem is undecidable in general. If frames are restricted to N or general linear orders, then satisfiability is known to be decidable, but of…

Computational Complexity · Computer Science 2012-06-13 Stefan Göller , Arne Meier , Martin Mundhenk , Thomas Schneider , Michael Thomas , Felix Weiss

The classical Baldwin-Lachlan characterization of uncountably categorical theories is known to fail in continuous logic in that not every inseparably categorical theory has a strongly minimal set. Here we investigate these issues by…

Logic · Mathematics 2022-08-12 James Hanson
‹ Prev 1 4 5 6 7 8 10 Next ›