English
Related papers

Related papers: Semantic A-translation and Super-consistency entai…

200 papers

In this paper, we give a new proof of the classical KAM theorem on the persistence of an invariant quasi-periodic torus, whose frequency vector satisfies the Bruno-R\"ussmann condition, in real-analytic non-degenerate Hamiltonian systems…

Dynamical Systems · Mathematics 2015-06-18 Abed Bounemoura , Stephane Fischler

Making use of inverse Mellin transform techniques for analytical continuation, an elegant proof and an extension of the zeta function regularization theorem is obtained. No series commutations are involved in the procedure; nevertheless the…

High Energy Physics - Theory · Physics 2007-05-23 E. Elizalde , S. Leseduarte , S. Zerbini

We study the geometry of unitary Shimura varieties without assuming the existence of an ordinary locus. We prove, by a simple argument, the existence of canonical subgroups on a strict neighborhood of the $\mu$-ordinary locus (with an…

Number Theory · Mathematics 2016-12-16 Stéphane Bijakowski

This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…

Category Theory · Mathematics 2013-04-29 Peter Hines

We observe some puzzling linguistic data concerning ordinary knowledge ascriptions that embed an epistemic (im)possibility claim. We conclude that it is untenable to jointly endorse both classical logic and a pair of intuitively attractive…

Logic in Computer Science · Computer Science 2023-07-12 Peter Hawke

Given an arbitrary sheaf $\mathcal{E}$ of $\mathcal{A}$-modules (or $\mathcal{A}$-module in short) on a topological space $X$, we define \textit{annihilator sheaves} of sub-$\mathcal{A}$-modules of $\mathcal{E}$ in a way similar to the…

Symplectic Geometry · Mathematics 2008-02-29 A. Mallios , P. P. Ntumba

Bayesian reasoning plays a significant role both in human rationality and in machine learning. In this paper, we introduce transfinite modal logic, which combines modal logic with ordinal arithmetic, in order to formalize Bayesian reasoning…

Artificial Intelligence · Computer Science 2022-04-08 Xinyu Wang

Let $X$ be a projective variety with a torus action, which for simplicity we assume to have dimension 1. If $X$ is a smooth complex variety, then the geometric invariant theory quotient $X//G$ can be identifed with the symplectic reduction…

alg-geom · Mathematics 2008-02-03 Dan Edidin , William Graham

We develop silting theory of a noetherian algebra $\Lambda$ over a commutative noetherian ring $R$. We study mutation theory of $2$-term silting complexes of $\Lambda$, and as a consequence, we see that mutation exists. As in the case of…

Representation Theory · Mathematics 2022-02-17 Yuta Kimura

Digraphs provide an alternative syntax for propositional logic, with digraph kernels corresponding to classical models. Semikernels generalize kernels and we identify a subset of well-behaved semikernels that provides nontrivial models for…

Logic · Mathematics 2019-06-11 Michal Walicki , Sjur Dyrkolbotn

We give a linear nested sequent calculus for the basic normal tense logic Kt. We show that the calculus enables backwards proof-search, counter-model construction and syntactic cut-elimination. Linear nested sequents thus provide the…

Logic in Computer Science · Computer Science 2019-07-03 Rajeev Goré , Björn Lellmann

We introduce proper display calculi for basic monotonic modal logic,the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

Urban and Bierman introduced a calculus of proof terms for the sequent calculus LK with a strongly normalizing reduction relation. We extend this calculus to simply-typed higher-order logic with inferences for induction and equality, albeit…

Logic in Computer Science · Computer Science 2018-10-18 Gabriel Ebner

We study cut elimination for a multifocused variant of full linear logic in the sequent calculus. The multifocused normal form of proofs yields problems that do not appear in a standard focused system, related to the constraints in grouping…

Logic in Computer Science · Computer Science 2015-02-18 Taus Brock-Nannestad , Nicolas Guenot

In this note we give a simple unifying proof of the undecidability of several diagrammatic properties of term rewriting systems that include: local confluence, strong confluence, diamond property, subcommutative property, and the existence…

Logic in Computer Science · Computer Science 2019-10-22 António Malheiro , Paulo Guilherme Santos

Based on an argument for the noncommutativity of momenta in noncommutative directions, we arrive at a generalization of the ${\cal N}=1$ super $E^2$ algebra associated to the deformation of translations in a noncommutative Euclidean plane.…

High Energy Physics - Theory · Physics 2014-11-18 Reza Abbaspur

Consistency regularization describes a class of approaches that have yielded ground breaking results in semi-supervised classification problems. Prior work has established the cluster assumption - under which the data distribution consists…

Computer Vision and Pattern Recognition · Computer Science 2020-08-12 Geoff French , Samuli Laine , Timo Aila , Michal Mackiewicz , Graham Finlayson

We study the eigenspace decomposition of a basic classical Lie superalgebra under the adjoint action of a toral subalgebra, thus extending results of Kostant. In recognition of Kostant's contribution we refer to the eigenspaces appearing in…

Representation Theory · Mathematics 2018-05-22 I. Dimitrov , R. Fioresi

We define base-extension semantics (Bes) using atomic systems based on sequent calculus rather than natural deduction. While traditional Bes aligns naturally with intuitionistic logic due to its constructive foundations, we show that…

Logic in Computer Science · Computer Science 2025-07-15 Victor Barroso-Nascimento , Ekaterina Piotrovskaya , Elaine Pimentel

It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented in the intuitionistic logic by double-negation, while the…

Logic in Computer Science · Computer Science 2010-06-17 Kaustuv Chaudhuri