English
Related papers

Related papers: Beth definability and the Stone-Weierstrass Theore…

200 papers

According to the basic idea of category theory, any Einstein algebra, essentially an algebraic formulation of general relativity, can be considered from the point of view of any object of the category of smooth algebras; such an object is…

Mathematical Physics · Physics 2022-10-26 Leszek Pysiak , Wiesław Sasin , Michael Heller , Tomasz Miller

The symmetric strict implication calculus $\mathsf{S^2IC}$ is a modal calculus for compact Hausdorff spaces. This is established through de Vries duality, linking compact Hausdorff spaces with de Vries algebras-complete Boolean algebras…

Logic · Mathematics 2025-02-11 Nick Bezhanishvili , Luca Carai , Silvio Ghilardi , Zhiguang Zhao

Originating in Girard's Linear logic, Ehrhard and Regnier's Taylor expansion of $\lambda$-terms has been broadly used as a tool to approximate the terms of several variants of the $\lambda$-calculus. Many results arise from a Commutation…

Logic in Computer Science · Computer Science 2024-02-14 Rémy Cerda , Lionel Vaux Auclair

The main purpose of the paper is to establish a closedness theorem over Henselian valued fields $K$ of equicharacteristic zero (not necessarily algebraically closed) with separated analytic structure. It says that every projection with a…

Algebraic Geometry · Mathematics 2018-01-09 Krzysztof Jan Nowak

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

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

Logic in Computer Science · Computer Science 2026-02-09 Justus Becker , Anupam Das , Sonia Marin , Paaras Padhiar

I introduce PEDAL -- a probabilistic epistemic logic meant to capture, in propositional dynamic terms, the epistemic state of an agent engaged in checking whether a program meets its specification. Semantically, PEDAL is built `on top of'…

Logic in Computer Science · Computer Science 2026-04-27 Shay Allen Logan

For a real analytic periodic function $\phi:\mathbb{R}\to \mathbb{R}$, an integer $b\ge 2$ and $\lambda\in (1/b,1)$, we prove the following dichotomy for the Weierstrass-type function $W(x)=\sum\limits_{n\ge 0}{{\lambda}^n\phi(b^nx)}$:…

Dynamical Systems · Mathematics 2021-07-26 Haojie Ren , Weixiao Shen

By using a selective filtration argument, we prove that the satisfiability problem of the unimodal logic of density is in $EXPTIME$. By using a tableau-like approach, we prove that the satisfiability problem of the bimodal logic of weak…

Logic in Computer Science · Computer Science 2025-07-16 Philippe Balbiani , Olivier Gasquet

The celebrated and famous Weierstrass approximation theorem characterizes the set of continuous functions on a compact interval via uniform approximation by algebraic polynomials. This theorem is the first significant result in…

Classical Analysis and ODEs · Mathematics 2008-05-07 Dilcia Perez , Yamilet Quintana

In this paper, we present an interactive semantics for derivations in an infinitary extension of classical logic. The formulas of our language are possibly infinitary trees labeled by propositional variables and logical connectives. We show…

Logic in Computer Science · Computer Science 2014-09-12 Michele Basaldella

Let $T$ be a theory with a definable topology. $T$ is t-minimal in the sense of Mathews if every definable set in one variable has finite boundary. If $T$ is t-minimal, we show that there is a good dimension theory for definable sets,…

Logic · Mathematics 2026-05-06 Will Johnson

The following is an open problem in topology: Determine whether the Stone-\v{C}ech compactification of a widely-connected space is necessarily an indecomposable continuum. Herein we describe properties of $X$ that are necessary and…

General Topology · Mathematics 2018-07-02 David Sumner Lipham

The tensor powers of the vector representation associated to an infinite rank quantum group decompose into irreducible components with multiplicities independant of the infinite root system considered. Although the irreducible modules…

Combinatorics · Mathematics 2007-05-23 Cedric Lecouvey

In this paper we introduce several quantitative methods for the lambda-calculus based on partial metrics, a well-studied variant of standard metric spaces that have been used to metrize non-Hausdorff topologies, like those arising from…

Logic in Computer Science · Computer Science 2024-11-19 Valentin Maestracci , Paolo Pistone

Let $k$ be a non-archimedean complete valued field and $X$ be a $k$-analytic space in the sense of Berkovich. In this note, we prove the equivalence between three properties: 1) for every complete valued extension $k'$ of $k$, every…

Algebraic Geometry · Mathematics 2018-12-24 Marco Maculan , Jérôme Poineau

We prove a Model Existence Theorem for a fully infinitary logic for metric structures. This result is based on a generalization of the notions of approximate formulas and approximate truth in normed structures introduced by Henson and…

Logic · Mathematics 2007-05-23 Carlos Ortiz

Effect algebras form a formal algebraic description of the structure of the so-called effects in a Hilbert space which serves as an event-state space for effects in quantum mechanics. This is why effect algebras are considered as logics of…

Logic · Mathematics 2019-08-16 Ivan Chajda , Helmut Länger

We consider the intersection map on the family of non-empty $\omega$-Scott-open sets of the lattice of opens of a topological space. We prove that in a certain class of topological spaces the intersection map forms a continuous retraction…

Logic · Mathematics 2015-01-27 Matthias Schröder

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
‹ Prev 1 8 9 10 Next ›