English
Related papers

Related papers: The Omega Rule is $\mathbf{\Pi_{1}^{1}}$-Complete …

200 papers

We address the problem of complementing higher-order patterns without repetitions of existential variables. Differently from the first-order case, the complement of a pattern cannot, in general, be described by a pattern, or even by a…

Logic in Computer Science · Computer Science 2008-10-22 Alberto Momigliano , Frank Pfenning

This investigation explores using the beta function formalism to calculate analytic solutions for the observable parameters in rolling scalar field cosmologies. The beta function in this case is the derivative of the scalar $\phi$ with…

Cosmology and Nongalactic Astrophysics · Physics 2018-05-02 Rodger I. Thompson

The loop equations for the $\beta$-ensembles are conventionally solved in terms of a $1/N$ expansion. We observe that it is also possible to fix $N$ and expand in inverse powers of $\beta$. At leading order, for the one-point function…

Mathematical Physics · Physics 2023-04-21 Peter J. Forrester

Using the superspace formalism, we compute for the two-dimensional N=1 supersymmetric non-linear $\sigma$-model, the order $(\alpha^{\prime})^{2}$ $(R_{mnpq})^2$ (three-loop) correction to the central charge via the operator product…

High Energy Physics - Theory · Physics 2009-10-28 Marcia E. Wehlau

In this paper we present a semantics for a linear algebraic lambda-calculus based on realizability. This semantics characterizes a notion of unitarity in the system, answering a long standing issue. We derive from the semantics a set of…

Logic in Computer Science · Computer Science 2019-12-06 Alejandro Díaz-Caro , Mauricio Guillermo , Alexandre Miquel , Benoît Valiron

Let $K$ be a compact metric space. A real-valued function on $K$ is said to be of Baire class one (Baire-1) if it is the pointwise limit of a sequence of continuous functions. In this paper, we study two well known ordinal indices of…

Classical Analysis and ODEs · Mathematics 2007-05-23 Denny H. Leung , Wee-Kee Tang

We present a call-by-need $\lambda$-calculus that enables strong reduction (that is, reduction inside the body of abstractions) and guarantees that arguments are only evaluated if needed and at most once. This calculus uses explicit…

Logic in Computer Science · Computer Science 2023-06-22 Thibaut Balabonski , Antoine Lanco , Guillaume Melquiond

In this paper we study the $\Gamma$-limit, as $p\to 1$, of the functional $$ J_{p}(u)=\frac{\displaystyle\int_\Omega |\nabla u|^p + \beta\int_{ \partial \Omega} |u|^p}{\displaystyle \int_\Omega |u|^p}, $$ where $\Omega$ is a smooth bounded…

Analysis of PDEs · Mathematics 2022-05-12 Francesco Della Pietra , Carlo Nitsch , Francescantonio Oliva , Cristina Trombetti

Given $\beta\in(1,2)$, a $\beta$-expansion of a real $x$ is a power series in base $\beta$ with coefficients 0 and 1 whose sum equals $x$. The aim of this note is to study certain problems related to the universality and combinatorics of…

Dynamical Systems · Mathematics 2007-05-23 Nikita Sidorov

Given a bounded domain $\Omega \subset {\Bbb R}^d$ with positive measure and a finite set $A=\{a^1, a^2, \dots, a^d\}$, we say that the set ${\mathcal E}(A)={\{e^{2 \pi i x \cdot a^j}\}}_{a^j \in A}$ is a complete exponential system if for…

Classical Analysis and ODEs · Mathematics 2020-07-17 Alex Iosevich , Azita Mayeli

Let $S$ be a complete star-omega semiring and $\Sigma$ be an alphabet. For a weighted $\omega$-restricted one-counter automaton $\mathcal{C}$ with set of states $\{1, \dots, n\}$, $n \geq 1$, we show that there exists a mixed algebraic…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Manfred Droste , Werner Kuich

This is a conitunation of [1] and [2]. We prove that if function $f$ belongs to the class $\Lambda_{\omega} \overset{\text{def}}{=} \{f: \omega_{f}(\delta)\leq \text{const} \omega(\delta)\} $ for an arbitrary modulus of continuity $\omega$,…

Functional Analysis · Mathematics 2016-05-18 Qinbo Liu

A new computational method that uses polynomial equations and dynamical systems to evaluate logical propositions is introduced and applied to Goedel's incompleteness theorems. The truth value of a logical formula subject to a set of axioms…

General Mathematics · Mathematics 2011-12-23 Joseph W. Norman

Let $\Omega$ be a bounded, smooth domain. Supposing that $\alpha(p) + \beta(p) = p$, $\forall\, p \in \left(\frac{N}{s},\infty\right)$ and $\displaystyle\lim_{p \to \infty} \alpha(p)/{p} = \theta \in (0,1)$, we consider two systems for the…

Analysis of PDEs · Mathematics 2023-04-04 Hamilton P Bueno , Aldo H S Medeiros

Let Omega(n) be the volume of the unit ball in R^n. We formulate as an infinite product the gamma function ratio gamma(x+1/2)/gamma(x),x>0, which allows us to reproduce and /or produce a variety of formulas and inequalities, some of them…

Classical Analysis and ODEs · Mathematics 2010-08-11 D. Karayannakis

The algebraic lambda calculus and the linear algebraic lambda calculus are two extensions of the classical lambda calculus with linear combinations of terms. They arise independently in distinct contexts: the former is a fragment of the…

Logic in Computer Science · Computer Science 2012-08-01 Ali Assaf , Simon Perdrix

In the course of proving a tenability result about the probabilities of conditionals, van Fraassen (1976) introduced a semantics for conditionals based on omega-sequences of worlds, which amounts to a particularly simple special case of…

Logic · Mathematics 2026-05-19 Cian Dorr , Matt Mandelkern

In this note, as a particular case of a more general result, we obtain the following theorem: Let $\Omega\subseteq {\bf R}^n$ be a non-empty bounded open set and let $f:\overline {\Omega}\to {\bf R}^n$ be a continuous function which is…

Analysis of PDEs · Mathematics 2016-02-17 Biagio Ricceri

An irrational number $\theta$ is called Diophantine if there exist $c>0$ and $\tau < \infty$ such that $\left| \theta - \frac{p}{q} \right| \ge \frac{c}{q^\tau}$ holds for every $(p,q) \in \mathbb{Z} \times \mathbb{N}$. In this paper, we…

Number Theory · Mathematics 2026-03-02 Geraldo César Gonçalves Ferreira , Sávio Ribas

We study Milner's encoding of the call-by-value $\lambda$-calculus into the $\pi$-calculus. We show that, by tuning the encoding to two subcalculi of the $\pi$-calculus (Internal $\pi$ and Asynchronous Local $\pi$), the equivalence on…

Logic in Computer Science · Computer Science 2022-02-08 Adrien Durier , Daniel Hirschkoff , Davide Sangiorgi
‹ Prev 1 8 9 10 Next ›