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 20 of 150 for “"decidability"”.

  1. Significance and decidability

    According to the empiricist criterion of meaning, a sentence makes a meaningful assertion, and thus can be said to be true or false, only if either it is analytic or it is capable, at least in principle, of experiential test. Sentences of this kind are significant sentences. Although many …

    bu Repository record for Significance and decidability (opens in a new tab) Embargoed until 2999-01-01

  2. Decidability in Algebraic Geometry

    … theme of our investigation is the concept of Decidability in Algebra/Algebraic Geometry. To the best of our knowledge this seems to be novel in the sense that there is no work known to isolate or to focus on the concept of Decidability in the context of Commutative Algebra. Decidability is …

    utk-theses Repository record for Decidability in Algebraic Geometry (opens in a new tab)

  3. Decidability boundaries in linear dynamical systems

    <p>The object of this thesis is the study of the decidability properties of linear dynamical systems, which have fundamental ties to theoretical computer science, software verification, linear hybrid systems, and control theory. <p>In particular, we describe a method for deciding the termination of …

    oxford Repository record for Decidability boundaries in linear dynamical systems (opens in a new tab)

  4. Decidability in extensions of Fp((t))

    … the existence of an algebraically prime model) decidability of the first-order theory of F_p((t)). However, this technical condition is still largely mysterious. We sketch an (unsuccessful) attempt at an unconditional proof and highlight where difficulties arise.</p> <p>In Chapter 1 we introduce …

    oxford Repository record for Decidability in extensions of Fp((t)) (opens in a new tab)

  5. GUARDED NETKAT: SOUNDNESS, PARTIAL-COMPLETENESS, DECIDABILITY

    The equational theory of Kleene Algebra with Tests (KAT) provides an algebraic framework to manipulate uninterpreted programs along with a PSPACE-complete procedure for deciding program equivalence. One of the most successful applications of the KAT theory is found in NetKAT, which instantiates the …

    cornell Repository record for GUARDED NETKAT: SOUNDNESS, PARTIAL-COMPLETENESS, DECIDABILITY (opens in a new tab)

  6. Decidability for Residuated Lattices and Substructural Logics

    We present a number of results related to the decidability and undecidability of various varieties of residuated lattices and their corresponding substructural logics. The context of this analysis is the extension of residuated lattices by various simple equations, dually, the extension of …

    denver Repository record for Decidability for Residuated Lattices and Substructural Logics (opens in a new tab)

  7. Turing Decidability and Computational Complexity of MorseHomology

    … is computable in the classical sense of Turing decidability, bound the complexity of finding the Morse homology of a given simplicial complex, and provide a measure for when this is more efficient than simplicial homology.

    vt Repository record for Turing Decidability and Computational Complexity of MorseHomology (opens in a new tab)

  8. 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)

  9. Decidability and Algorithmic Analysis of Dependent Object Types (DOT)

    … This thesis presents a detailed investigation of decidability and algorithmic properties of the family of DOT calculi. In decidability analysis, the undecidability of subtyping of several calculi is formally established, including the D <: and D ∧ calculi. Prior to this investigation, the …

    waterloo Repository record for Decidability and Algorithmic Analysis of Dependent Object Types (DOT) (opens in a new tab)

  10. Decidability for Non-Standard Conversions in Typed Lambda-Calculi

    This thesis studies the decidability of conversions in typed lambda-calculi, along with the algorithms allowing for this decidability. Our study takes in consideration conversions going beyond the traditional beta, eta, or permutative conversions (also called commutative conversions). To decide …

    lmu-germany Repository record for Decidability for Non-Standard Conversions in Typed Lambda-Calculi (opens in a new tab)

  11. On the decidability of finite extensions of decidable fields

    <p>This paper is primarily concerned with the following question which first appeared in Koenigsmann’s On a Question of Abraham Robinson’s:</p> <p><em>Is a finite field extension of a decidable field always decidable?</em></p> <p>This offers a “twist” to a question that was originally posed by …

    oxford Repository record for On the decidability of finite extensions of decidable fields (opens in a new tab)

  12. Expressiveness and Decidability of Weighted Automata and Weighted Logics

    … structure. In the second part, we lift four decidability results from max-plus word automata to max-plus tree automata. Max-plus word and tree automata are weighted automata over the max-plus semiring and assign real numbers to words or trees, respectively. We show that, like for max-plus …

    qucosa-diss

  13. Decidability in the Hyperdegrees and a Theorem of Hyperarithmetic Analysis

    In this thesis we explore two different topics: the complexity of the theory of the hyperdegrees, and the reverse mathematics of a result in graph theory. For the first, we show the $\Sigma_{2}$ theory of the hyperdegrees as an upper-semilattice is decidable, as is the $\Sigma_{2}$ theory of the …

    cornell Repository record for Decidability in the Hyperdegrees and a Theorem of Hyperarithmetic Analysis (opens in a new tab)

  14. Contributions to Recognizability: Self-generating Sets, Decidability, Automaticity and Multidimensional Sets

    … alternative decision procedure for a well-known decidability problem. Next, we give bounds on the automaticity of three different languages: the language of primitive words over a finite alphabet, the language of unbordered words over a finite alphabet and the language of representations of monic …

    liege Repository record for Contributions to Recognizability: Self-generating Sets, Decidability, Automaticity and Multidimensional Sets (opens in a new tab) Download PDF for Contributions to Recognizability: Self-generating Sets, Decidability, Automaticity and Multidimensional Sets (opens in a new tab)

  15. Closure, Decidability, and Complexity Results for Restricted Variants of Two-Dimensional Automata

    … that can be applied to an automaton's language), decidability properties (questions about languages and automata that can be answered by an algorithm), and complexity properties (computational resources needed to decide problems or recognize languages). We first consider decision problems for …

    queens Repository record for Closure, Decidability, and Complexity Results for Restricted Variants of Two-Dimensional Automata (opens in a new tab)

  16. Abstract Numeration Systems : Recognizability, Decidability, Multidimensional S-Automatic Words, and Real Numbers

    … on polynomial regular languages. The second is a decidability problem, which has been already studied notably by J. Honkala and A. Muchnik and which is studied here for two new cases: the linear positional numeration systems and the abstract numeration systems. Next, we focus on the extension to …

    liege Repository record for Abstract Numeration Systems : Recognizability, Decidability, Multidimensional S-Automatic Words, and Real Numbers (opens in a new tab) Download PDF for Abstract Numeration Systems : Recognizability, Decidability, Multidimensional S-Automatic Words, and Real Numbers (opens in a new tab)

  17. On the decidability of the field of maximal abelian extension of p-adic numbers

    <p>In this project we investigate some approaches attacking the question of whether the theory of the maximal abelian extension of the p-adic numbers is decidable. A list of axioms is presented whose completeness we aim to show via quantifier elimination. We separated the quantifier elimination …

    oxford Repository record for On the decidability of the field of maximal abelian extension of p-adic numbers (opens in a new tab)

Page 1 of 8