Combining Finite Combination Properties: Finite Models and Busy Beavers

07/15/2023
by   Guilherme Toledo, et al.
0

This work is a part of an ongoing effort to understand the relationships between properties used in theory combination. We here focus on including two properties that are related to shiny theories: the finite model property and stable finiteness. For any combination of properties, we consider the question of whether there exists a theory that exhibits it. When there is, we provide an example with the simplest possible signature. One particular class of interest includes theories with the finite model property that are not finitely witnessable. To construct such theories, we utilize the Busy Beaver function.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/03/2023

Combining Combination Properties: An Analysis of Stable Infiniteness, Convexity, and Politeness

We make two contributions to the study of theory combination in satisfia...
research
08/13/2018

Proving Program Properties as First-Order Satisfiability

Program semantics can often be expressed as a (many-sorted) first-order ...
research
06/02/2021

An Equational Logical Framework for Type Theories

A wide range of intuitionistic type theories may be presented as equatio...
research
08/17/2021

Stable combination tests

This paper proposes a stable combination test, which is a natural extens...
research
09/24/2021

Process tomography in general physical theories

Process tomography, the experimental characterization of physical proces...
research
11/21/2022

Finite Model Properties for Residuated Semigroups

We have a quick look at various finite model properties for residuated s...

Please sign up or login with your details

Forgot password? Click here to reset