English
Related papers

Related papers: An extension of Kracht's theorem to generalized Sa…

200 papers

We present the basic ideas of forms (a generalization of Ehresmann's sketches) and their theories and models, more explicitly than in previous expositions. Forms provide the ability to specify mathematical structures and data types in any…

Category Theory · Mathematics 2008-09-19 Atish Bagchi , Charles Wells

Traditional treatments of formal logic provide: 1. A syntax for formulas. 2. An inference relation between sets of formulas. 3. A rule for assigning meaning to formulas (semantics) that is sound with respect to the inference relation. First…

Logic · Mathematics 2016-09-06 Atish Bagchi , Charles Wells

A consistent canonical classical and quantum dynamics in the framework of special relativity was formulated by Stueckelberg in 1941, and generalized to many body theory by Horwitz and Piron in 1973 (SHP). In this paper, this theory is…

General Physics · Physics 2019-07-02 L. P. Horwitz

Many important computational structures involve an intricate interplay between algebraic features (given by operations on the underlying set) and relational features (taking account of notions such as order or distance). This paper…

Logic in Computer Science · Computer Science 2024-12-18 Jan Jurka , Stefan Milius , Henning Urbat

We propose a modal logic tailored to describe graph transformations and discuss some of its properties. We focus on a particular class of graphs called termgraphs. They are first-order terms augmented with sharing and cycles. Termgraphs…

Logic in Computer Science · Computer Science 2010-03-24 Ph. Balbiani , R. Echahed , A. Herzig

We present a general relational semantics framework which, by varying the axiomatization and components of the relational structures, provides a uniform semantics for sentential logics, classical and non-classical alike. The approach we…

Logic in Computer Science · Computer Science 2025-11-25 Chrysafis Hartonas

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…

Logic in Computer Science · Computer Science 2010-11-23 Facundo Carreiro

We construct a large family of commutative algebras of partial differential operators invariant under rotations. These algebras are isomorphic extensions of the algebras of ordinary differential operators introduced by Grunbaum and Yakimov…

Classical Analysis and ODEs · Mathematics 2012-05-08 Plamen Iliev

A generalization of the Heisenberg algebra has been recently constructed. This generalized algebra has a characteristic function which depends on one of its generators. When this function is linear, $qJ_0+s$, it is possible to construct a…

High Energy Physics - Phenomenology · Physics 2016-09-06 C. I. Ribeiro-Silva , N. M. Oliveira-Neto

Lindstr\"om theorems characterize logics in terms of model-theoretic conditions such as Compactness and the L\"owenheim-Skolem property. Most existing characterizations of this kind concern extensions of first-order logic. But on the other…

Logic in Computer Science · Computer Science 2015-07-01 Johan van Benthem , Balder ten Cate , Jouko Vaananen

For schemes X over global or local fields, or over their rings of integers, K. Kato stated several conjectures on certain complexes of Gersten-Bloch-Ogus type, generalizing the fundamental exact sequence of Brauer groups for a global field.…

Algebraic Geometry · Mathematics 2014-12-05 Uwe Jannsen

Frick and Grohe [J. ACM 48 (2006), 1184-1206] introduced a notion of graph classes with locally bounded tree-width and established that every first order logic property can be decided in almost linear time in such a graph class. Here, we…

Data Structures and Algorithms · Computer Science 2011-08-30 Tomas Gavenciak , Daniel Kral , Sang-il Oum

The present paper develops a unified correspondence treatment of the Sahlqvist theory for possibility semantics, extending the results in \cite{Ya16} from Sahlqvist formulas to the strictly larger class of inductive formulas, and from the…

Logic · Mathematics 2016-12-16 Zhiguang Zhao

We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…

Logic in Computer Science · Computer Science 2024-04-26 Hashimoto Go , Daniel Găină , Ionuţ Ţuţu

For each finite subgroup G of SL(n, C), we introduce the generalized Cartan matrix C_{G} in view of McKay correspondence from the fusion rule of its natural representation. Using group theory, we show that the generalized Cartan matrices…

Quantum Algebra · Mathematics 2013-07-09 Xiaoli Hu , Naihuan Jing , Wuxing Cai

In proof-theoretic semantics, model-theoretic validity is replaced by proof-theoretic validity. Validity of formulae is defined inductively from a base giving the validity of atoms using inductive clauses derived from proof-theoretic rules.…

Logic · Mathematics 2024-02-02 David Pym , Eike Ritter , Edmund Robinson

Kolmogorov introduced an informal calculus of problems in an attempt to provide a classical semantics for intuitionistic logic. This was later formalised by Medvedev and Muchnik as what has come to be called the Medvedev and Muchnik…

Logic · Mathematics 2015-07-14 Rutger Kuyper

Dependence logic provides an elegant approach for introducing dependencies between variables into the object language of first-order logic. In [1] generalized quantifiers were introduced in this context. However, a satisfactory account was…

Logic · Mathematics 2024-04-29 Fredrik Engström

In this paper we establish a new characterization of 4-valued modal algebras considered by A. Monteiro. In order to obtain this characterization we introduce a new class of algebras named generalized I-algebras. This class contains strictly…

Logic · Mathematics 2012-03-28 Aldo V. Figallo , Paolo Landini

The present paper aims at establishing formal connections between correspondence phenomena, well known from the area of modal logic, and the theory of display calculi, originated by Belnap. These connections have been seminally observed and…