Beyond First-Order Satisfaction: Fixed Points, Interpolants, Automata and Polynomials

Author(s):  
Thomas Ball ◽  
Nikolaj Bjørner ◽  
Leonardo de Moura ◽  
Kenneth L. McMillan ◽  
Margus Veanes
Keyword(s):  
2020 ◽  
Author(s):  
Michał Walicki

Abstract Graph normal form, introduced earlier for propositional logic, is shown to be a normal form also for first-order logic. It allows to view syntax of theories as digraphs, while their semantics as kernels of these digraphs. Graphs are particularly well suited for studying circularity, and we provide some general means for verifying that circular or apparently circular extensions are conservative. Traditional syntactic means of ensuring conservativity, like definitional extensions or positive occurrences guaranteeing exsitence of fixed points, emerge as special cases.


2019 ◽  
Vol 17 (1) ◽  
pp. 677-688 ◽  
Author(s):  
Hai-Ying Chen ◽  
Xiu-Min Zheng

Abstract In this paper, we investigate the relationships between fixed points of meromorphic functions, and their higher order differences and shifts, and generalize the case of fixed points into the more general case for first order difference and shift. Concretely, some estimates on the order and the exponents of convergence of special points of meromorphic functions and their differences and shifts are obtained.


2011 ◽  
Vol 143 (6) ◽  
pp. 1136-1153 ◽  
Author(s):  
Shuangli Fan ◽  
Fan Zhong

An extensive series of experiments on pentadecanoic acid monolayers has been made at 25°C with several independent methods of surface manometry. The purpose of the study was to establish a set of surface pressures for the three monolayer phase transitions to act as surface manometric standards. It was coincidentally demonstrated in high purity systems that the so-called liquid-expanded-liquid-condensed transition is simply first order. The experimental requirements for reproducible surface manometry are described. Less extensive data on hexadecanoic acid are also given to invite further critical experiments.


2017 ◽  
Vol 33 (3) ◽  
pp. 301-310
Author(s):  
MELANIA-IULIA DOBRICAN ◽  

In this paper we provide some existence and uniqueness theorems for coupled fixed points for a pair of contractive operators satisfying a mixed monotone property, in a metric space endowed with a reflexive relation. An application to a first-order differential system equation with PBV conditions is also given to illustrate the utility of our results.


2005 ◽  
Vol 70 (3) ◽  
pp. 696-712 ◽  
Author(s):  
Johan Van Benthem

AbstractMinimal predicates P satisfying a given first-order description ϕ(P) occur widely in mathematical logic and computer science. We give an explicit first-order syntax for special first-order ‘PIA conditions’ ϕ(P) which guarantees unique existence of such minimal predicates. Our main technical result is a preservation theorem showing PIA-conditions to be expressively complete for all those first-order formulas that are preserved under a natural model-theoretic operation of ‘predicate intersection’. Next, we show how iterated predicate minimization on PIA-conditions yields a language MIN(FO) equal in expressive power to LFP(FO), first-order logic closed under smallest fixed-points for monotone operations. As a concrete illustration of these notions, we show how our sort of predicate minimization extends the usual frame correspondence theory of modal logic, leading to a proper hierarchy of modal axioms: first-order-definable, first-order fixed-point definable, and beyond.


Sign in / Sign up

Export Citation Format

Share Document