Revisiting the generalized Łoś-Tarski theorem

11/15/2018
by   Abhisekh Sankaran, et al.
0

We present a new proof of the generalized Łoś-Tarski theorem (GLT(k)) introduced in [1], over arbitrary structures. Instead of using λ-saturation as in [1], we construct just the "required saturation" directly using ascending chains of structures. We also strengthen the failure of GLT(k) in the finite shown in [2], by strengthening the failure of the Łoś-Tarski theorem in this context. In particular, we prove that not just universal sentences, but for each fixed k, even Σ^0_2 sentences containing k existential quantifiers fail to capture hereditariness in the finite. We conclude with two problems as future directions, concerning the Łoś-Tarski theorem and GLT(k), both in the context of all finite structures. [1] 10.1016/j.apal.2015.11.001 ; [2] 10.1007/978-3-642-32621-9_22

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/17/2020

Node Failure Localization: Theorem Proof

This is a technical report, containing all the theorem proofs in paper "...
research
09/07/2023

On Statman's Finite Completeness Theorem

We give a complete self-contained proof of Statman's finite completeness...
research
05/24/2022

A Formalization of Finite Group Theory

Previous formulations of group theory in ACL2 and Nqthm, based on either...
research
08/01/2020

Big Ramsey degrees of 3-uniform hypergraphs are finite

We prove that the universal homogeneous 3-uniform hypergraph has finite ...
research
09/02/2020

Big Ramsey degrees using parameter spaces

We show that the universal homogeneous partial order has finite big Rams...
research
04/05/2022

When Locality Meets Preservation

This paper investigates the expressiveness of a fragment of first-order ...
research
04/17/2019

Sesqui-Pushout Rewriting: Concurrency, Associativity and Rule Algebra Framework

Sesqui-pushout (SqPO) rewriting provides a variant of transformations of...

Please sign up or login with your details

Forgot password? Click here to reset