Linear Formulas in Continuous Logic
Authors
Abstract:
We prove that continuous sentences preserved by the ultramean construction (a generalization of the ultraproduct construction) are exactly those sentences which are approximated by linear sentences. Continuous sentences preserved by linear elementary equivalence are exactly those sentences which are approximated in the Riesz space generated by linear sentences. Also, characterizations for linear $Delta_n$-sentences and positive linear theories will be given.
similar resources
Saturated Formulas in Full Linear Logic
In this note, we show by a proof-theoretical argument that in full linear logic the set of formulas for which contraction and weakening are admissible (the set of saturated formulas) does not coincide (up to equivalences) with the set of exponentiated formulas. This solves an open problem of Schellinx.
full textDeciding Provability of Linear Logic Formulas
A great deal of insight about a logic can be derived from the study of the diiculty of deciding if a given formula is provable in that logic. Most rst order logics are undecidable and are linear time decidable with no quantiiers and no propositional symbols. However , logics diier greatly in the complexity of deciding propositional formulas. For example, rst-order classical logic is undecidable...
full textIdentifying meaningless parameterized linear - temporal - logic formulas
Parameterized runtime monitoring formalisms allow predicates to bind free variables to values during the program’s execution. Some runtime monitoring tools, like J-LO , increase the formalism’s expressiveness by allowing predicates to query variables already during the matching process. This is problematic because, if no special care is taken, the predicate’s evaluation may need to query a vari...
full textGenerating Linear Temporal Logic Formulas for Pattern-Based Specifications
Software property classi cations and patterns, i.e., highlevel abstractions that describe program behavior, have been used to assist practitioners in specifying properties. The Speci cation Pattern System (SPS) provides descriptions of a collection of patterns. Each pattern is associated with a scope that de nes the extent of program execution over which a property pattern is considered. Based ...
full textGenerating Linear Temporal Logic Formulas for Pattern-Based Speci cations
Software property classi cations and patterns, i.e., highlevel abstractions that describe program behavior, have been used to assist practitioners in specifying properties. The Speci cation Pattern System (SPS) provides descriptions of a collection of patterns. Each pattern is associated with a scope that de nes the extent of program execution over which a property pattern is considered. Based ...
full textPrediction Formulas for Continuous Time Linear Rational Expectations Models
l1li' 11' In this note we derive optimal prediction formulas to be used in solving continuous time rational expectations models. In these derivations we employ Laplace transforms in a manner analogous to the use of z transforms for solving discrete time optimal prediction problems in Hansen and Sargent (1980a, Appendix A). The formulas are intended to play the same role for continuous time mode...
full textMy Resources
Journal title
volume 17 issue 2
pages 75- 86
publication date 2022-09
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023