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 26 for “"Undecidability"”.
-
Two undecidability results in probabilistic automata theory
Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1985.
-
Unsimulability, Universality, and Undecidability in the Gizmo Framework
… all gizmos in its simulability class), and undecidability (the inability to decide whether a maze made of a gizmo is solvable). We give a proof that the 1- toggle cannot simulate the 2-toggle, as it contains important techniques. We explore a class of gizmos called dicrumbler variants, and …
-
Decidability for Residuated Lattices and Substructural Logics
… 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 substructural logics …
-
Truncation in differential Hahn fields
… with truncation as an extra primitive yields undecidability in several settings. Our main results, however, concern the robustness of being truncation closed in generalized series fields equipped with a derivation, and under extension procedures that involve this derivation. In the last …
-
Internet Dwelling, Cyborgs, and the Matrix of Modernity: An Empirical Inquiry with Critical-Hermeneutic Features
… interpretive bodily powers contribute to "undecidability" about meaning constructions and identities. Despite multiple identity solicitations, normalization of objectified and schizoid being, and "panoptic" e-surveillance, participants pursued genuine and personally satisfying encounters.
-
SET THEORY FOR KNOWLEDGE REPRESENTATION
… decades, and decision procedures or proofs of undecidability have been provided for several quantified and unquantified fragments of set theory. In this thesis we study the decision problem for three novel quantified fragments of set theory, which allow the explicit manipulation of ordered …
-
Sue
… a dense field of meaning, meant to capture the undecidability of language noted by philosopher Jacques Derrida. This collection also employs several vectors of derivation, including erasure of text lifted from the 2002 strategy video game <em>Fire Emblem: The Binding Blade </em>and a sequence of …
-
Decision problems over infinite graphs : higher order pushdown systems and synchronized products
… products. This result is complemented by undecidability results for extensions of the admissible product operations as well as the expressive power of the logic under consideration.
-
Abstract state machines: verification problems and computational power
… of ASMs but it leads rather directly to undecidability respectively uncomputability results in the unrestricted case. Consequently, we arrive rather early at the question whether there exist expressive classes of ASMs for which we can prove decidability and computability results. In the …
-
On Weak Number Theories
… separate but quite related topics in logic. Many undecidability results are proved by positive definability results. In Chapter 1 we reformulate Schinzel's theorem about diophantine equations with parameters to get some number theoretic results. In later chapter we apply these results to solve …
-
The complexity of description logics with concrete domains
… of concrete domains and general TBoxes leads to undecidability of reasoning, there exists an interesting temporal concrete domain that can be combined with general TBoxes without sacrificing decidability. This concrete domain is used to devise a rather powerful interval-based temporal Description …
-
Art in the public realm and the politics of rural leisure: Access and environment
… complemental practice based on dissensus and the undecidability of subject and context, but which dismisses any inflexible schema of either aesthetic autonomy or ethico-political egalitarianism. In addition it suggests an approach to practice in this field and a situation for this - a dissensual …
-
Conjunctive polymorphic type checking with explicit types
… of "type" is shown, along with the undecidability of the type relation. It is shown how the computational portion of the language can be modified to accommodate explicit type information which may direct an automatic type derivation. This new language has the principal type property …
-
A framework for proving the computational intractability of motion planning problems
… hardness results ranging from NL-completeness to Undecidability. Full dichotomies are obtained for some classes including the natural class of gadgets which can be traversed a bounded number of times. For 1-player this gives a separation between containment in NL versus NP-completeness, for …
-
Query Answering over Contextualized RDF/OWL Knowledge with Expressive Bridge Rules: Decidable classes
… the chase to be of polynomial size. Besides the undecidability result of unrestricted quad-systems, tight complexity bounds has been established for each of the classes we have introduced. We then compare the problems, (resp. classes,) we address (resp. derive) in this thesis, for quad-systems …
-
Social justice after Kant: Between constructivism and deconstruction (Rawls, Habermas, Levinas, Derrida)
… in part through his readings of Kant, the undecidability of the critical function of justice. Committed to the possibility of justice, Derrida also acknowledges its impossibility: no local determination can reconcile responsibility before the other with impartiality among all. [New …
-
Path Constraints for Databases With or Without Schemas
… is co-r.e. complete. However, in light of these undecidability results, several decidable fragments of the constraint language are identified. These fragments suffice to express many important integrity constraints such as referential integrity, inverse relationships and local database …
-
Expressiveness of Concurrent Languages
… these dialects by focusing on decidability and undecidability for problems like reachability and coverability.
-
Low-Level Static Analysis for Memory Usage and Control Flow Recovery
… to handle many interesting functions due to the undecidability of memory usage. Fully-interactive methods do not scale well either. Sound control flow recovery (CFR) is also important for binary decompilation, verification, patching, and security analysis. It lifts raw unstructured data into a …
-
Automata-based decision procedures for weak arithmetics
… <br>the boundary between decidability and undecidability for WS1S with <br>cardinality constraints. Our investigation is based on the fact that <br>the classical connection between automata and WS1S carries over to a <br>fragment of the extension of WS1S and finite word automata with an …
Page 1 of 2