Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"Presburger Arithmetic"”.

  1. Modest Automorphisms of Presburger Arithmetic

    … we study some such expansions of models of Presburger arithmetic. Building on some of the work of Harnik (1986) and Llewellyn-Jones (2001), in Chapter 2 we use a back-and-forth construction to obtain two automorphisms of sufficiently saturated models of Presburger arithmetic. These …

    cuny-grad Repository record for Modest Automorphisms of Presburger Arithmetic (opens in a new tab)

  2. Decidability bounds for extensions of Presburger arithmetic

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-12-04 without embargo terms

    uiuc Repository record for Decidability bounds for extensions of Presburger arithmetic (opens in a new tab)

  3. Automata-based decision procedures for weak arithmetics

    … decidability of different weak systems of <br>arithmetic. A prominent example is the weak monadic second-order logic <br>of one successor, WS1S for short, which is tightly connected to <br>automata over finite words. Nowadays, automata have also emerged as a <br>tool for effectively mechanizing …

    freiburg-diss Repository record for Automata-based decision procedures for weak arithmetics (opens in a new tab)

  4. Specification and analysis of timing properties in real-time systems

    … a property to be verified can be expressed as arithmetical relations on algebraic expressions involving the event occurrences. To verify the property with respect to the system specification, we prove that the property is a theorem derivable from the specification. Relationship of RTL to …

    texas Repository record for Specification and analysis of timing properties in real-time systems (opens in a new tab)

  5. Definability and decidability for expansions of arithmetic by sets definable from positional numeration systems

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-12-04 without embargo terms

    uiuc Repository record for Definability and decidability for expansions of arithmetic by sets definable from positional numeration systems (opens in a new tab)