中文
相关论文

相关论文: Well-orders in the transfinite Japaridze algebra

200 篇论文

This talk is a sneak preview of the project, 'proof theory for theories of ordinals'. Background, aims, survey and furture works on the project are given. Subsystems of second order arithmetic are embedded in recursively large ordinals and…

逻辑 · 数学 2013-04-11 Toshiyasu Arai

In this paper we study random orderings of the integers with a certain invariance property. We describe all such orders in a simple way. We define and represent random shuffles of a countable set of labels and then give an interpretation of…

概率论 · 数学 2007-05-23 Saul Jacka , Jon Warren

Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic semantics, where Kripke frames are replaced with coalgebras for…

计算机科学中的逻辑 · 计算机科学 2010-02-03 Lutz Schroeder , Dirk Pattinson

A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…

计算机科学中的逻辑 · 计算机科学 2011-07-08 Emmanuel Beffara

In this paper we give an ordinal analysis of the theory of second order arithmetic. We do this by working with proof trees -- that is, "deductions" which may not be well-founded. Working in a suitable theory, we are able to represent…

逻辑 · 数学 2024-03-27 Henry Towsner

We study a transfinite iteration of the ordinal Hessenberg natural sum obtained by taking suprema at limit stages and show that such an iterated natural sum differs from the more usual transfinite ordinal sum only for a finite number of…

逻辑 · 数学 2019-01-17 Paolo Lipparini

We provide a method of constructing better-quasi-orders by generalising a technique for constructing operator algebras that was developed by Pouzet. We then generalise the notion of $\sigma$-scattered to partial orders, and use our method…

逻辑 · 数学 2014-10-02 Gregory McKay

In this paper we show how the abstract behaviours of higher-order systems can be modelled as final coalgebras of suitable behavioural functors. These functors have the challenging peculiarity to be circularly defined with their own final…

计算机科学中的逻辑 · 计算机科学 2016-07-12 Marco Peressotti

Necessary and sufficient conditions are given for the similarity between two perturbations of the (backward) shift by rank one operators, under certain assumptions on the perturbations. The proof of similarity is based on an explicit…

泛函分析 · 数学 2012-07-17 Leonel Robert

We present a proof-theoretic analysis of the logic NL$\lambda$ (Barker \& Shan 2014, Barker 2019). We notably introduce a novel calculus of proof nets and prove it is sound and complete with respect to the sequent calculus for the logic. We…

计算与语言 · 计算机科学 2020-10-26 Richard Moot

Since the very beginning of the theory of linear logic it is known how to represent the $\lambda$-calculus as linear logic proof nets. The two systems however have different granularities, in particular proof nets have an explicit notion of…

计算机科学中的逻辑 · 计算机科学 2018-08-13 Beniamino Accattoli

Solving zero-dimensional polynomial systems using Gr\"obner bases is usually done by, first, computing a Gr\"obner basis for the degree reverse lexicographic order, and next computing the lexicographic Gr\"obner basis with a change of order…

符号计算 · 计算机科学 2022-05-17 Jérémy Berthomieu , Vincent Neiger , Mohab Safey El Din

It is well known that ordered exponential fields with a compatible non-trivial valuation cannot be spherically complete, but there are some that are ``complete enough''. This paper gives analogues of Kaplansky's theorem on maximally valued…

逻辑 · 数学 2026-03-06 Pietro Freni

This paper can be seen as an attempt of rethinking the {\em Extra-Gradient Philosophy} for solving Variational Inequality Problems. We show that the properly defined {\em Reduced Gradients} can be used instead for finding approximate…

最优化与控制 · 数学 2023-12-05 Yurii Nesterov

We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.

逻辑 · 数学 2018-04-18 Lars Kristiansen , Juvenal Murwanashyaka

Resolution and superposition are common techniques which have seen widespread use with propositional and first-order logic in modern theorem provers. In these cases, resolution proof production is a key feature of such tools; however, the…

计算机科学中的逻辑 · 计算机科学 2018-04-19 Jan Gorzny , Ezequiel Postan , Bruno Woltzenlogel Paleo

There are two well-known ways of doing arithmetic with ordinal numbers: the "ordinary" addition, multiplication, and exponentiation, which are defined by transfinite iteration; and the "natural" (or Hessenberg) addition and multiplication…

逻辑 · 数学 2017-11-10 Harry Altman

We study singular integral operators with variable Calder\'on--Zygmund kernels and their commutators with $VMO$ functions in the framework of Orlicz spaces. After revisiting the classical $L^p$ theory, we establish boundedness results in…

偏微分方程分析 · 数学 2026-05-26 Amiran Gogatishvili , Pia Salerno , Lubomira Softova

This paper provides a new categorification of the Lebesgue integral with variable upper limits by using normed modules over finite-dimensional $\Bbbk$-algebras $\mathit{\Lambda}$ and the category $\mathscr{A}^p_{\mathit{\Lambda}}$…

范畴论 · 数学 2025-05-01 Miantao Liu , Yu-Zhe Liu , Shengda Liu

We study varieties of certain ordered $\Sigma$-algebras with restricted completeness and continuity properties. We give a general characterization of their free algebras in terms of submonads of the monad of $\Sigma$-coterms. Varieties of…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Zoltan Esik , Dexter Kozen
‹ 上一页 1 8 9 10 下一页 ›