English
Related papers

Related papers: Elements of Librationism

200 papers

We propose a set theory strong enough to interpret powerful type theories underlying proof assistants such as LEGO and also possibly Coq, which at the same time enables program extraction from its constructive proofs. For this purpose, we…

Logic in Computer Science · Computer Science 2015-07-01 Wojciech Moczydlowski

This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…

Logic · Mathematics 2025-08-12 Mauro Avon

We propose a new paradigm for Belief Change in which the new information is represented as sets of models, while the agent's body of knowledge is represented as a finite set of formulae, that is, a finite base. The focus on finiteness is…

Logic in Computer Science · Computer Science 2023-09-13 Ricardo Guimarães , Ana Ozaki , Jandson S. Ribeiro

The usual examples of Bergman spaces consist of the closure of an algebra of holomorphic functions on a domain. One can also take the real part of such functions, but essentially one is looking at the same object. In this paper the author…

Complex Variables · Mathematics 2022-09-07 Mark G. Lawrence

In the framework of restricted five bodies problem, the existence and stability of the libration points are explored and analysed numerically, under the effect of non--isotropic mass variation of the fifth body (test particle or…

Chaotic Dynamics · Physics 2020-05-25 Md SanamSuraj , Elbaz I. Abouelmagd , Rajiv Aggarwal , Amit Mittal

This thesis is intended to provide an account of the theory and applications of Operational Methods that allow the "translation" of the theory of special functions and polynomials into a "different" mathematical language. The language we…

Classical Analysis and ODEs · Mathematics 2018-03-09 Silvia Licciardi

In this paper, we study the weighted composition operator on the Fock space $\mf$ of slice regular functions. First, we characterize the boundedness and compactness of the weighted composition operator. Subsequently, we describe all the…

Functional Analysis · Mathematics 2018-03-20 Pan Lian , Yu-Xia Liang

This book is mainly an exposition of the author's works and his joint works with his former students on explicit representations of finite-dimensional simple Lie algebras, related partial differential equations, linear orthogonal algebraic…

Representation Theory · Mathematics 2016-01-29 Xiaoping Xu

We offer a view of mathematics as an experimental science where axioms play the role of foundational theories like general relativity and quantum mechanics in physics. Under this view, axioms are provisional and inferred from experience…

History and Overview · Mathematics 2026-04-29 Asvin G

There is sufficient amount of internal evidence in the nature of gravitational theories to indicate that gravity is an emergent phenomenon like, e.g, elasticity. Such an emergent nature is most apparent in the structure of gravitational…

Cosmology and Nongalactic Astrophysics · Physics 2015-06-05 T. Padmanabhan

Given a class C of word languages, the C-separation problem asks for an algorithm that, given as input two regular languages, decides whether there exists a third language in C containing the first language, while being disjoint from the…

Formal Languages and Automata Theory · Computer Science 2017-09-29 Thomas Place , Marc Zeitoun

Wittgenstein's paradoxical theses that unproved propositions are meaningless, proofs form new concepts and rules, and contradictions are of limited concern, led to a variety of interpretations, most of them centered on the rule-following…

History and Overview · Mathematics 2022-06-24 Sergiy Koshkin

We construct a realizability model of linear dependent type theory from a linear combinatory algebra. Our model motivates a number of additions to the type theory. In particular, we add a universe with two decoding operations: one takes…

Logic in Computer Science · Computer Science 2026-02-10 Sam Speight , Niels van der Weide

Beginning with a simple semantics for propositions, based on counting observations, it is shown that probabilistic and fuzzy logic correspond to two different heuristic assumptions regarding the combination of propositions whose evidence…

Artificial Intelligence · Computer Science 2020-09-29 Ben Goertzel

We lay the ground for an Isabelle/ZF formalization of Cohen's technique of forcing. We formalize the definition of forcing notions as preorders with top, dense subsets, and generic filters. We formalize the definition of forcing notions as…

Logic in Computer Science · Computer Science 2018-11-28 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf

The concept of informal mathematical proof considered in intuitionism is apparently vulnerable to a version of the liar paradox. However, a careful reevaluation of this concept reveals a subtle error whose correction blocks the…

Logic · Mathematics 2010-04-14 Nik Weaver

The separation between two theorems in reverse mathematics is usually done by constructing a Turing ideal satisfying a theorem P and avoiding the solutions to a fixed instance of a theorem Q. Lerman, Solomon and Towsner introduced a forcing…

Logic · Mathematics 2015-03-13 Ludovic Patey

We propose an axiomatic approach to constructing the dynamics of systems, in which one the main elements is the consciousness of a subject. The main axiom is the statements that the state of consciousness is completely determined by the…

General Physics · Physics 2012-09-11 Igor Tuluzov , Sergiy Melnyk

Lifting theorems are theorems that bound the communication complexity of a composed function $f\circ g^{n}$ in terms of the query complexity of $f$ and the communication complexity of $g$. Such theorems constitute a powerful generalization…

Computational Complexity · Computer Science 2024-04-12 Yahel Manor , Or Meir

We compare three approaches to studying the behavior of an analytic function $f(z)=\sum_{k=0}^\infty a_kz^k$ from its Taylor coefficients. The first is "Taylor domination" property for $f(z)$ in the complex disk $D_R$, which is an…

Classical Analysis and ODEs · Mathematics 2014-12-01 Dmitry Batenkov , Yosef Yomdin
‹ Prev 1 8 9 10 Next ›