scholarly journals General proof of Osterwalder-Schrader positivity for the Wilson action

1987 ◽  
Vol 113 (3) ◽  
pp. 369-373 ◽  
Author(s):  
P. Menotti ◽  
A. Pelissetto
Keyword(s):  
1967 ◽  
Vol 24 (8) ◽  
pp. 411-412 ◽  
Author(s):  
Y.S. Jin
Keyword(s):  

2021 ◽  
pp. 1-23
Author(s):  
FÁBIO NATALI ◽  
SABRINA AMARAL

Abstract The purpose of this paper is to present an extension of the results in [8]. We establish a more general proof for the moving kernel formula to prove the spectral stability of periodic traveling wave solutions for the regularized Benjamin–Bona–Mahony type equations. As applications of our analysis, we show the spectral instability for the quintic Benjamin–Bona–Mahony equation and the spectral (orbital) stability for the regularized Benjamin–Ono equation.


1998 ◽  
Vol 13 (02) ◽  
pp. 83-86 ◽  
Author(s):  
MARCO LOMBARDI

In this letter we provide a new proof of a general theorem on gravitational lenses, first proven by Burke (1981) for the special case of thin lenses. The theorem states that a transparent gravitational lens with non-singular mass distribution produces an odd number of images of a point source. Our general proof shows that the topological degree finds natural and interesting applications in the theory of gravitational lenses.


In the modern theory of electronic conduction the electrons are considered, when the thermal motion of the lattice is neglected, as moving in a periodic potential with the property V ( x + la , y + ma , z + na ) = V ( x, y, z ). The wave equation for an electron in this field is { h 2/8π2 m ∇ 2 + E K - V} ψ K = 0. Block has shown that this equation has solutions of the form ψ K = e i K.R U K (R), where U K has the periodicity of the lattice.


1985 ◽  
Vol 22 (1) ◽  
pp. 168-176 ◽  
Author(s):  
P. Whittle
Keyword(s):  

A direct and general proof is given of the equivalence of partial balance and insensitivity.


Synthese ◽  
1974 ◽  
Vol 27 (1-2) ◽  
pp. 63-77 ◽  
Author(s):  
Dag Prawitz
Keyword(s):  

2019 ◽  
Vol 29 (8) ◽  
pp. 1344-1378
Author(s):  
TOMER LIBAL ◽  
MARCO VOLPE

One of the main issues in proof certification is that different theorem provers, even when designed for the same logic, tend to use different proof formalisms and produce outputs in different formats. The project ProofCert promotes the usage of a common specification language and of a small and trusted kernel in order to check proofs coming from different sources and for different logics. By relying on that idea and by using a classical focused sequent calculus as a kernel, we propose here a general framework for checking modal proofs. We present the implementation of the framework in a Prolog-like language and show how it is possible to specialize it in a simple and modular way in order to cover different proof formalisms, such as labelled systems, tableaux, sequent calculi and nested sequent calculi. We illustrate the method for the logic K by providing several examples and discuss how to further extend the approach.


Sign in / Sign up

Export Citation Format

Share Document