English
Related papers

Related papers: Unified First Law and Some Comments

200 papers

In this paper, we establish some fixed point theorems in ordered partial metric spaces. An example is given to illustrate our obtained results.

General Topology · Mathematics 2016-10-05 Hassen Aydi

Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard…

Logic in Computer Science · Computer Science 2017-03-08 Lidia Tendera

A recollection of some theoretical developments that preceded and followed the first formulation of supergravity theory is presented. Special emphasis is placed on the impact of supergravity on the search for a unified theory of fundamental…

High Energy Physics - Theory · Physics 2007-05-23 Sergio Ferrara

We consider a language together with the subword relation, the cover relation, and regular predicates. For such structures, we consider the extension of first-order logic by threshold- and modulo-counting quantifiers. Depending on the…

Formal Languages and Automata Theory · Computer Science 2019-01-09 Dietrich Kuske , Georg Zetzsche

These notes on string theory are based on a series of talks I gave during my graduate studies. As the talks, this introductory essay is intended for young students and non-string theory physicists.

High Energy Physics - Theory · Physics 2007-05-23 Oswaldo Zapata

In these lectures we review the motivation, principles of and (circumstantial) evidence for the program of unification of the fundamental forces. In an appendix, we review the group theory pertinent to the program.

High Energy Physics - Phenomenology · Physics 2007-05-23 B. Ananthanarayan

We extend a law of the single logarithm for delayed sums by Lai to delayed sums of random fields. A law for subsequences, which also includes the one-dimensional case, is obtained in passing.

Statistics Theory · Mathematics 2008-12-18 Allan Gut , Ulrich Stadtmüller

A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…

Classical Analysis and ODEs · Mathematics 2011-10-26 Armen Bagdasaryan

We review principal results on axiomatizability of classes of lattices of equivalences

Logic · Mathematics 2025-07-29 Christian Herrmann

In this expository article we provide an elegant proof of the one-sided Ingham-Karamata Tauberian theorem. As an application, we present a short deduction of the prime number theorem.

Number Theory · Mathematics 2024-03-27 Gregory Debruyne

This paper gives an overview of some basic properties of Leibniz algebras. Some of the results were known earlier, but in the article they are accompanied by new simple proofs. Some of the results are new. The article can be viewed as a…

Rings and Algebras · Mathematics 2013-03-04 V. V. Gorbatsevich

To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…

Number Theory · Mathematics 2021-08-03 Jorma Jormakka , Sourangshu Ghosh

Classically, in saturation-based proof systems, unification has been considered atomic. However, it is also possible to move unification to the calculus level, turning the steps of the unification algorithm into inferences. For calculi that…

Logic in Computer Science · Computer Science 2024-03-11 Ahmed Bhayat , Johannes Schoisswohl , Michael Rawson

Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof…

Logic in Computer Science · Computer Science 2010-11-23 Facundo Carreiro

Complex reasoning problems are most clearly and easily specified using logical rules, but require recursive rules with aggregation such as count and sum for practical applications. Unfortunately, the meaning of such rules has been a…

Databases · Computer Science 2023-08-29 Yanhong A. Liu , Scott D. Stoller

We announce here that Fermat's Last theorem was solved, but there is an easy proof of it on the basis of elemetary undergraduate mathematics. We shall disclose such an easy proof.

General Mathematics · Mathematics 2021-10-13 YangGon Kim , SooGon Kim , BumSeok Jeon , SeungKon Kim , ChangKon Kim

We develop a simple and intuitive identity for calculating expectations of weighted $k$-fold sums over particles in branching processes, generalising the well-known many-to-one lemma.

Probability · Mathematics 2014-09-12 Simon C. Harris , Matthew I. Roberts

Due to the omission of a hypothesis from an elementary lemma in the author's paper "Gleason parts and point derivations for uniform algebras with dense invertible group", some of the proofs presented in that paper are flawed. We prove here…

Complex Variables · Mathematics 2019-10-28 Alexander J. Izzo

The classical Technical Lemma for congruences is not difficult to prove but it is very efficient in its applications. We present here a Technical Lemma for congruences on \emph{finite lattices}. This is not difficult to prove either but it…

Rings and Algebras · Mathematics 2013-08-27 George Grätzer

In the framework of generalized Oppenheim expansions we prove strong law of large numbers for lightly trimmed sums. In the first part of this work we identify a particular class of expansions for which we provide a convergence result…

Probability · Mathematics 2023-11-07 Milto Hadjikyriakou , Rita Giuliano
‹ Prev 1 4 5 6 7 8 10 Next ›