English
Related papers

Related papers: Scott processes

200 papers

In the paper we introduce a weak set theory $\mathsf{H}_{<\omega}$ . A formalization of arithmetic on finite von Neumann ordinals gives an embedding of arithmetical language into this theory. We show that $\mathsf{H}_{<\omega}$ proves a…

Logic · Mathematics 2019-08-29 Fedor Pakhomov

In this paper we prove that the Scott topology $\mathfrak S$ on a rooted non-metric tree $\mathcal T$ is strictly coarser than the weak tree topology. Moreover, for each $t\in \mathcal T$, we consider a natural order $\preceq_t$ on…

Commutative Algebra · Mathematics 2015-09-22 Josnei Novacoski

We review some older and more recent results concerning the energy and particle distribution in ground states of heavy Coulomb systems. The reviewed results are asymptotic in nature: they describe properties of many-particle systems in the…

Mathematical Physics · Physics 2023-02-07 Rupert L. Frank , Konstantin Merz , Heinz Siedentop

Irreversibility is usually captured by a comparison between the process that happens and a corresponding "reverse process". In the last decades, this comparison has been extensively studied through fluctuation relations. Here we revisit…

Statistical Mechanics · Physics 2021-10-11 Clive Cenxin Aw , Francesco Buscemi , Valerio Scarani

Let $L$ be the language of rings. We provide an axiomatization of the $L$-theories of quaternions and octonions and characterize their models: they coincide, up to isomorphism, with quaternion and octonion algebras over a real closed field,…

Algebraic Geometry · Mathematics 2026-05-05 Enrico Savi

We extend the complete ordered set Dana Scott's $D_\infty$ to a complete weakly ordered Kan complex $K_\infty$, with properties that guarantee the non-equivalence of the interpretation of some higher conversions of $\beta\eta$-conversions…

Logic in Computer Science · Computer Science 2026-04-07 Daniel O. Martínez-Rivillas , Ruy J. G. B. de Queiroz

In this paper we present a proof of Hartogs' extension theorem, following T. Sobieszek's paper from 2003. Hartogs' theorem provides a large class of domains where holomorphic functions have analytic continuation to larger domains, and is "a…

Complex Variables · Mathematics 2016-08-03 Aleksander Simonič

We develop general machinery to cast the class of potential canonical Scott sentences of an infinitary sentence $\Phi$ as a class of structures in a related language. From this, we show that $\Phi$ has a Borel complete expansion if and only…

Logic · Mathematics 2023-03-30 Michael C. Laskowski , Douglas S. Ulrich

We present a logic for the reasoning about necessity and justifications which is independent from relational semantics. We choose the concept of justification -- coming from a class of "Justification Logics" (Artemov 2008, Fitting 2009) --…

Logic in Computer Science · Computer Science 2015-03-20 Steffen Lewitzka

This paper is devoted to establishing the full scaling limit theorems for multivariate Hawkes processes. Under some mild conditions on the exciting kernels, we develop a new way to prove that after a suitable time-spatial scaling, the…

Probability · Mathematics 2024-12-20 Wei Xu

Nakano's "later" modality, inspired by G\"{o}del-L\"{o}b provability logic, has been applied in type systems and program logics to capture guarded recursion. Birkedal et al modelled this modality via the internal logic of the topos of…

Logic in Computer Science · Computer Science 2015-04-20 Ranald Clouston , Rajeev Goré

We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…

Logic in Computer Science · Computer Science 2014-01-24 Abhisekh Sankaran , Bharat Adsul , Supratik Chakraborty

We introduce the subject of modal model theory, where one studies a mathematical structure within a class of similar structures under an extension concept that gives rise to mathematically natural notions of possibility and necessity. A…

Logic · Mathematics 2020-09-22 Joel David Hamkins , Wojciech Aleksander Wołoszyn

This paper establishes model-theoretic properties of $\mathrm{FOE}^{\infty}$, a variation of monadic first-order logic that features the generalised quantifier $\exists^\infty$ (`there are infinitely many'). We provide syntactically defined…

Logic in Computer Science · Computer Science 2018-09-11 Facundo Carreiro , Alessandro Facchini , Yde Venema , Fabio Zanasi

A transduction provides us with a way of using the monadic second-order language of a structure to make statements about a derived structure. Any transduction induces a relation on the set of these structures. This article presents a…

Combinatorics · Mathematics 2024-01-24 Susan Jowett , Dillon Mayhew , Songbao Mo , Christopher Tuffley

Since the introduction by Hodges, and refinement by V\"a\"an\"anen, team semantic constructions have been used to generate expressively enriched logics still conserving nice properties, such as compactness or decidability. In contrast,…

Logic · Mathematics 2023-11-21 Fredrik Engström , Orvar Lorimer Olsson

We study various formulations of the completeness of first-order logic phrased in constructive type theory and mechanised in the Coq proof assistant. Specifically, we examine the completeness of variants of classical and intuitionistic…

Logic in Computer Science · Computer Science 2021-12-15 Yannick Forster , Dominik Kirst , Dominik Wehr

We provide a concrete introduction to the topologised, graded analogue of an algebraic structure known as a plethory, originally due to Tall and Wraith. Stacey and Whitehouse showed this structure is present on the cohomology operations for…

K-Theory and Homology · Mathematics 2021-09-15 William Mycroft , Sarah Whitehouse

We forge connections between the theory of fractal sets obtained as attractors of iterated function systems and process calculi. To this end, we reinterpret Milner's expressions for processes as contraction operators on a complete metric…

Logic in Computer Science · Computer Science 2025-06-25 Todd Schmid , Victoria Noquez , Lawrence S. Moss

A family of partial functions of a class of algebras $\mathsf{K}$ is said to be an implicit operation of $\mathsf{K}$ when it is defined by a first order formula and it is preserved by homomorphisms. In this work, we develop the theory of…

Rings and Algebras · Mathematics 2026-04-24 Luca Carai , Miriam Kurtzhals , Tommaso Moraschini
‹ Prev 1 4 5 6 7 8 10 Next ›