English
Related papers

Related papers: $\Sigma^{\mu}_2$ is decidable for $\Pi^{\mu}_2$

200 papers

A formal series in noncommuting variables $\Sigma$ over the rationals is a mapping $\Sigma^* \to \mathbb Q$. We say that a series is commutative if the value in the output does not depend on the order of the symbols in the input. The…

Formal Languages and Automata Theory · Computer Science 2025-05-19 Lorenzo Clemente

The paper deals with $\Sigma-$composition of terms, which allows us to extend the derivation rules in formal deduction of identities. The concept of essential variables and essential positions of terms with respect to a set of identities is…

General Mathematics · Mathematics 2010-01-19 Slavcho Shtrakov

Earlier we presented a method to decompose modal formulas for processes with the internal action $\tau$, and congruence formats for branching and $\eta$-bisimilarity were derived on the basis of this decomposition method. The idea is that a…

Logic in Computer Science · Computer Science 2017-12-22 Wan Fokkink , Rob van Glabbeek

We define bilateral series related to Ramanujan-like series for $1/\pi^2$. Then, we conjecture a property of them and give some applications.

Number Theory · Mathematics 2019-06-05 Jesús Guillera

Working with the simple types over a base type of natural numbers (including product types), we consider the question of when a type $\sigma$ is encodable as a definable retract of $\tau$: that is, when there are $\lambda$-terms…

Logic in Computer Science · Computer Science 2018-06-04 John Longley

A decidability proof for bisimulation equivalence of first-order grammars is given. It is an alternative proof for a result by S\'enizergues (1998, 2005) that subsumes his affirmative solution of the famous decidability question for…

Logic in Computer Science · Computer Science 2020-08-18 Petr Jancar

We prove that the basis and the generating function of a geometric grid class of permutations Geom$(M)$ are computable from the matrix $M$, as well as some variations on this result. Our main tool is monadic second-order logic on…

Combinatorics · Mathematics 2025-11-21 Samuel Braunfeld

We consider the question as to whether the exponent of a computably presentable Lebesgue space whose dimension is at least 2 must be computable. We show this very natural conjecture is true when the exponent is at least 2 or when the space…

Logic · Mathematics 2020-01-01 Timothy H. McNicholl

We obtained a new formula for $\pi$.

Number Theory · Mathematics 2025-11-05 Nikita Kalinin , Mikhail Shkolnikov

We give a formula for the determinant of an $n\times n$ matrix with entries from a commutative ring with unit. The formula can be evaluated by a "straight-line program" performing only additions, subtractions and multiplications of ring…

Computational Complexity · Computer Science 2022-06-02 Nicholas Pippenger

It is known that several variations of the axiom of determinacy play important roles in the study of reverse mathematics, and the relation between the hierarchy of determinacy and comprehension are revealed by Tanaka, Nemoto, Montalb\'an,…

Logic · Mathematics 2023-05-22 Leonardo Pacheco , Keita Yokoyama

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 give a reciprocity formula for a two-variable sum where the variables satisfy a linear congruence condition. We also prove that such sum is a measure of how well a rational is approximable from below and show that the reciprocity formula…

Number Theory · Mathematics 2017-01-25 Sandro Bettin

We state conjectures that relate Hermitian modular forms of degree two and algebraic modular forms for the compact group $SO(6)$. We provide evidence for these conjectures in the form of dimension formulas and explicit computations of…

Number Theory · Mathematics 2025-05-30 Tomoyoshi Ibukiyama , Brandon Williams

Given a (complex, smooth) irreducible representation $\pi$ of the general linear group over a non-archimedean local field and an irreducible supercuspidal representation $\sigma$ of a classical group, we show that the (normalized) parabolic…

Representation Theory · Mathematics 2020-06-22 Erez Lapid , Marko Tadić

Probabilistic justification logic is a modal logic with two kind of modalities: probability measures and explicit justification terms. We present a tableau procedure that can be used to decide the satisfiability problem for this logic in…

Logic in Computer Science · Computer Science 2017-08-15 Ioannis Kokkinis

In this paper, we define a realizability semantics for the simply typed $\lambda\mu$-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. This result serves to give characterizations of the…

Logic · Mathematics 2009-05-05 Karim Nour , Khelifa Saber

The main purpose of this paper is to give a mathematical definition of ``mirror symmetry'' for Calabi-Yau and G_2 manifolds. More specifically, we explain how to assign a G_2 manifold (M,\phi,\Lambda), with the calibration 3-form \phi and…

Differential Geometry · Mathematics 2007-06-14 Selman Akbulut , Sema Salur

A space $X$ is said to be $\pi$-metrizable if it has a $\sigma$-discrete $\pi$-base. In this paper, we mainly give affirmative answers for two questions about $\pi$-metrizable spaces. The main results are that: (1) A space $X$ is…

General Topology · Mathematics 2013-02-19 Fucai Lin , Shou Lin

There have been many generalizations of Shoenfield's Theorem on the absoluteness of $\Sigma^1_2$ sentences between uncountable transitive models of $\mathrm{ZFC}$. One of the strongest versions currently known deals with $\Sigma^2_1$…

Logic · Mathematics 2007-05-23 W. Hugh Woodin
‹ Prev 1 3 4 5 6 7 10 Next ›