Result 1 to 20 of 91 total
The structure and definability in the lattice of equational theories of strongly permutative semigroups. (English)
Trans. Am. Math. Soc. 364, No. 6, 2959-2985 (2012).
1
Definability in classes of finite structures. (English)
Esparza, Javier (ed.) et al., Finite and algorithmic model theory. Based on the workshop at the University of Durham, UK, January 9‒13, 2006. Cambridge: Cambridge University Press (ISBN 978-0-521-71820-2/pbk). London Mathematical Society Lecture Note Series 379, 140-176 (2011).
2
Defining integers. (English)
Bull. Symb. Log. 17, No. 2, 230-251 (2011).
3
Loop-separable programs and their first-order definability. (English)
Artif. Intell. 175, No. 3-4, 890-913 (2011).
4
A logical formulation of rough set definability. (English)
Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 19, No. 1, 27-37 (2011).
5
Definability in the subword order. (English)
Ferreira, Fernando (ed.) et al., Programs, proofs, processes. 6th conference on computability in Europe, CiE 2010, Ponta Delgada, Azores, Portugal, June 30‒July 4, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13961-1/pbk). Lecture Notes in Computer Science 6158, 246-255 (2010).
6
Deciding whether the ordering is necessary in a Presburger formula. (English)
Discrete Math. Theor. Comput. Sci. 12, No. 1, 21-38, electronic only (2010).
7
Algebraic characterization of logically defined tree languages. (English)
Int. J. Algebra Comput. 20, No. 2, 195-239 (2010).
8
An extension of Kracht’s theorem to generalized Sahlqvist formulas. (English)
J. Appl. Non-Class. Log. 19, No. 2, 227-251 (2009).
9
Definability in the infix order on words. (English)
Diekert, Volker (ed.) et al., Developments in language theory. 13th international conference, DLT 2009, Stuttgart, Germany, June 30‒July 3, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02736-9/pbk). Lecture Notes in Computer Science 5583, 454-465 (2009).
10
Automorphisms of the lattice of equational theories of commutative semigroups. (English)
Trans. Am. Math. Soc. 361, No. 7, 3435-3462 (2009).
11
The modal formula $(\dagger )$ $\square \diamondsuit p \supset \square \diamondsuit \square \diamondsuit p$ is not first-order definable. (English)
Bosch, Peter (ed.) et al., Logic, language, and computation. 7th international Tbilisi symposium on logic, language, and computation, TbiLLC 2007, Tbilisi, Georgia, October 1‒5, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-642-00664-7/pbk). Lecture Notes in Computer Science 5422. Lecture Notes in Artificial Intelligence, 221-228 (2009).
12
An application of the Feferman-Vaught theorem to automata and logics for words over an infinite alphabet. (English)
Log. Methods Comput. Sci. 4, No. 1, Paper 8, 23 p., electronic only (2008).
13
Weakly maximal decidable structures. (English)
Theor. Inform. Appl. 42, No. 1, 137-145 (2008).
14
Automata presenting structures: A survey of the finite string case. (English)
Bull. Symb. Log. 14, No. 2, 169-209 (2008).
15
Computability and logic. 5th ed. (English)
Cambridge: Cambridge University Press (ISBN 978-0-521-70146-4/pbk; 978-0-521-87752-7/hbk). xiv, 350~p. \$~29.99, \sterling~18.99/pbk; \$~90.00, \sterling~45.00/hbk (2007).
16
Composition theorem for generalized sum. (English)
Fundam. Inform. 79, No. 1-2, 137-167 (2007).
17
First-order definable retraction problems for posets and reflexive graphs. (English)
J. Log. Comput. 17, No. 1, 31-51 (2007).
18
The truth about algorithmic problems in correspondence theory. (English)
Governatori, Guido (ed.) et al., Advances in modal logic. Vol. 6. Selected papers from the 6th conference (AiML 2006), Noosa, Australia, September 25‒28, 2006. London: College Publications (ISBN 1-904987-20-6/pbk). 121-138 (2006).
19
Definable classes of many valued Kripke frames. (English)
Bull. Sect. Log., Univ. Łódź, Dep. Log. 35, No. 1, 27-36 (2006).
20
Result 1 to 20 of 91 total
Start
Contact
Print
General Help
