Toward model theory with data values

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7392 LNCS, Issue PART 2, 2012, Pages 116-127

  Bojańczyk, Mikołaj ^a   Place, Thomas ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER CIRCUITS; FORMAL LOGIC; ROBOTS;

DATA GRAPH; DATA TREE; DATA VALUES; FIRST ORDER LOGIC; MODEL THEORY; NOMINAL SETS;

TREES (MATHEMATICS);

EID: 84883426002     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31585-5_14     Document Type: Conference Paper

References (6)

1. Bojanczyk, M., Braud, L., Klin, B., Lasota, S.: Towards nominal computation. In: POPL, pp. 401-412 (2012)
2. Bojanczyk, M., Klin, B., Lasota, S.: Automata with group actions. In: LICS, pp. 355-364 (2011)
3. Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Asp. Comput. 13(3-5), 341-363 (2002)
4. Gabbay, M.J.: Foundations of nominal techniques: logic and semantics of variables in abstract syntax. Bulletin of Symbolic Logic 17(2), 161-229 (2011)
5. Pitts, A.M.: Nominal logic, a first order theory of names and binding. Inf. Comput. 186(2), 165-193 (2003)
6. Segoufin, L.: Automata and Logics for Words and Trees over an Infinite Alphabet. In: ́Esik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 41-57. Springer, Heidelberg (2006)