Ralf Treinen  Home/Search
Context
Related
| lri.fr/LRI/articles/tr...concrete.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lri.fr/~treinen/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Contents 1 Introduction 3 1.1 Concrete Domains . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Notations and Preliminaries . . . . . . . . . . . . . . . . . . . . . 4 1.3 A Catalogue of Structures Considered in these Lectures . . . . . 4 1.3.1 Natural Numbers . . . . . . . . . . . . . . . . . . . . . . . 4 1.3.2 Words . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 1.3.3 Feature Trees . . . . . . . . . . . . . . . . . . . . . . . . . 8 1.3.4 Ground Terms modulo AC . . . . ... (Update)
Active bibliography (related documents): More All
0.5: Compiling Pattern Matching by Term Decomposition - Puel, Suarez (1989) (Correct)
0.3: Predicate Logic and Tree Automata with Tests - Treinen (2000) (Correct)
0.2: Iterating Transducers for Safety of Data-Abstractions - Dams, Lakhnech, Steffen (2000) (Correct)
Similar documents based on text: More All
0.2: Feature Trees over Arbitrary Structures - Treinen (1997) (Correct)
0.2: Equational and Membership Constraints for Infinite Trees - Niehren, Podelski, Treinen (1993) (Correct)
0.2: Undecidability of the Emptiness Problem of Reduction Automata.. - Treinen (2001) (Correct)
BibTeX entry: (Update)
@misc{ treinen-firstorder,
author = "Ralf Treinen",
title = "First-Order Theories of Concrete Domains",
url = "citeseer.ist.psu.edu/treinen01firstorder.html" }
Citations (may not include all citations):370 Mathematical Introduction to Logic (context) - Enderton - 1972
105 Records for logic programming - Smolka, Treinen - 1994
105 The problem of solvability of equations in a free semigroup (context) - Makanin - 1977
105 Word problems requiring exponential time (context) - Stockmeyer, Meyer - 1973
67 A variant of a recursively unsolvable problem (context) - Post - 1946
48 Super-exponential complexity of Presburger arithmetic - Fischer, Rabin - 1974
44 Encyclopedia of Mathematics and its Applications (context) - Hodges - 1993
43 The computational complexity of logical theories (context) - Ferrante, Racko - 1979
40 The complexity of decision problems in automata theory and l.. (context) - Larry - 1974
21 An improved lower bound for the elementary theories of trees - Vorobyov - 1996
20 Concatenation as a basis for arithmetic (context) - Quine - 1946
18 Enumerable sets are diophantine (context) - Matijasevic - 1970
15 Theoretical Computer Science (context) - Backofen, Smolka et al. - 1995
13 nite automata with an application to a decision problem of s.. (context) - Thatcher, Wright - 1968
13 nite objects (context) - Thomas, in - 1990
12 Makanin's algorithm (context) - Diekert - 2000
11 Decidability of second-order theories and automata on in nit.. (context) - Rabin - 1969
9 Feature trees over arbitrary structures - Treinen - 1997
6 Studying algorithmic problems for free semi-groups and group.. (context) - Durnev - 1997
6 cation in the Union of Disjoint Equational Theories: Combini.. (context) - Baader, Schulz - 1996
5 ber Formal Unentscheidbare Stze der Principia Mathematica un.. (context) - Gdel - 1931
4 Techniques and Applications (context) - Comon, Dauchet et al. - 1999
2 Institut National Polytechnique de Grenoble (context) - Comon, cation et al. - 1988
1 Oxford University Press (context) - Feferman, Gdel et al. - 1986
1 Equational Problems and Disuni cation (context) - Comon, Lescanne - 1989
1 Presburger arithmetic and nite automata (context) - Boudet, Comon - 1996
1 rst order theory of onestep right ground rewriting (context) - Marcinkowski, the - 1997
1 ber die Vollstndingkeit eines gewissen Systems der Arithmeti.. (context) - Presburger - 1929
1 Coding in the existential theory of concatenation (context) - Bchi, Senger - 1986
1 Institut fr Informatik und Praktische Mathematik der Christi.. (context) - Thomas, automata et al. - 1996
1 ability of word equations with constants is in NEXPTIME (context) - Plandowski - 1999
1 A new method for undecidability proofs of rst order theorie.. (context) - Treinen - 1992
Documents on the same site (http://www.lri.fr/~treinen/publications.html): More
Records for Logic Programming - Smolka, Treinen (1994) (Correct)
Constraint Deduction in an Interval-based Temporal Logic - Jana Koehler, Ralf Treinen (1993) (Correct)
A New Method for Undecidability Proofs of First Order Theories - Treinen (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC