Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
16 | Timos Antonopoulos, Dag Hovland, Wim Martens, Frank Neven |
Deciding twig-definability of node selecting tree automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: 15th International Conference on Database Theory, ICDT '12, Berlin, Germany, March 26-29, 2012, pp. 61-73, 2012, ACM, 978-1-4503-0791-8. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa |
Definability of linear equation systems over groups and rings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France, pp. 213-227, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-42-2. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Tomer Kotek, Johann A. Makowsky |
Connection Matrices and the Definability of Graph Parameters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France, pp. 411-425, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-42-2. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Johann A. Makowsky |
Definability and Complexity of Graph Parameters (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France, pp. 14-15, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-42-2. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Denis K. Ponomaryov, Dmitry Vlasov |
On Definability and Redundancy in $\cal{EL}$ -TBoxes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RR ![In: Web Reasoning and Rule Systems - 6th International Conference, RR 2012, Vienna, Austria, September 10-12, 2012. Proceedings, pp. 250-253, 2012, Springer, 978-3-642-33202-9. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Enrico Franconi, Nhung Ngo, Evgeny Sherkhonov |
The Definability Abduction Problem for Data Exchange - (Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
RR ![In: Web Reasoning and Rule Systems - 6th International Conference, RR 2012, Vienna, Austria, September 10-12, 2012. Proceedings, pp. 217-220, 2012, Springer, 978-3-642-33202-9. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Tomer Kotek |
Definability of combinatorial functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2012 |
RDF |
|
16 | Rohit Parikh |
Beth definability, interpolation and language splitting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Synth. ![In: Synth. 179(2), pp. 211-221, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Joseph Flenner |
Relative decidability and definability in henselian valued fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 76(4), pp. 1240-1260, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Tuan-Fang Fan, Churn-Jung Liau, Duen-Ren Liu |
A Logical Formulation of Rough Set Definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Uncertain. Fuzziness Knowl. Based Syst. ![In: Int. J. Uncertain. Fuzziness Knowl. Based Syst. 19(1), pp. 27-37, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Yin Chen 0005, Fangzhen Lin, Yan Zhang 0003, Yi Zhou 0013 |
Loop-separable programs and their first-order definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. ![In: Artif. Intell. 175(3-4), pp. 890-913, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Predrag Tanovic |
On definability of types of finite Cantor-Bendixson rank. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 57(3), pp. 256-260, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | George Barmpalias, C. S. Vlek |
Kolmogorov complexity of initial segments of sequences and arithmetical definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 412(41), pp. 5656-5667, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Larisa Maksimova |
Interpolation and Definability over the Logic Gl. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 99(1-3), pp. 249-267, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | David Fernández-Duque |
On the Modal Definability of Simulability by Finite Transitive Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 98(3), pp. 347-373, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Juha Kontinen, Jouko A. Väänänen |
Erratum to: On Definability in Dependence Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Lang. Inf. ![In: J. Log. Lang. Inf. 20(1), pp. 133-134, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Dugald Macpherson, Charles Steinhorn |
Definability in classes of finite structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Finite and Algorithmic Model Theory ![In: Finite and Algorithmic Model Theory., pp. 140-176, 2011, Cambridge University Press, 978-0-521-71820-2. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
16 | Juha Kontinen, Jakub Szymanik |
Characterizing Definability of Second-Order Generalized Quantifiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WoLLIC ![In: Logic, Language, Information and Computation - 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18-20, 2011. Proceedings, pp. 187-200, 2011, Springer, 978-3-642-20919-2. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Facundo Carreiro |
On Characterization, Definability and ω-Saturated Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAC ![In: Theoretical Aspects of Computing - ICTAC 2011 - 8th International Colloquium, Johannesburg, South Africa, August 31 - September 2, 2011. Proceedings, pp. 62-76, 2011, Springer, 978-3-642-23282-4. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Manuel Bodirsky, Michael Pinsker, Todor Tsankov |
Decidability of Definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, LICS 2011, June 21-24, 2011, Toronto, Ontario, Canada, pp. 321-328, 2011, IEEE Computer Society, 978-0-7695-4412-0. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Miguel Couceiro, Erkko Lehtonen, Tamás Waldhauser |
On Equational Definability of Function Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 41st IEEE International Symposium on Multiple-Valued Logic, ISMVL 2011, Tuusula, Finland, May 23-25, 2011, pp. 182-186, 2011, IEEE Computer Society, 978-0-7695-4405-2. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Tin Perkov |
Towards a Generalization of Modal Definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESSLLI Student Sessions ![In: New Directions in Logic, Language and Computation - ESSLLI 2010 and ESSLLI 2011 Student Sessions. Selected Papers, pp. 130-139, 2011, Springer, 978-3-642-31466-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Hans van Ditmarsch, David Fernández-Duque, Wiebe van der Hoek |
On the Definability of Simulability and Bisimilarity by Finite Epistemic Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CLIMA ![In: Computational Logic in Multi-Agent Systems - 12th International Workshop, CLIMA XII, Barcelona, Spain, July 17-18, 2011. Proceedings, pp. 74-87, 2011, Springer, 978-3-642-22358-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Kord Eickmeyer |
Non-Definability Results for Randomised First-Order Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 25th International Workshop / 20th Annual Conference of the EACSL, CSL 2011, September 12-15, 2011, Bergen, Norway, Proceedings, pp. 218-232, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-32-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Balder ten Cate, Enrico Franconi, Inanç Seylan |
Beth Definability in Expressive Description Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011, pp. 1099-1106, 2011, IJCAI/AAAI, 978-1-57735-516-8. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Tobias Ganzow |
Definability and model checking: the role of orders and compositionality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2011 |
RDF |
|
16 | José Raymundo Marcial-Romero, José Antonio Hernández Servín |
Functional first order definability of LRTP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inteligencia Artif. ![In: Inteligencia Artif. 14(48), pp. 28-40, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
16 | Jaroslav Jezek, Ralph McKenzie |
Definability in Substructure Orderings, II: Finite Ordered Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 27(2), pp. 115-145, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Harvey Friedman, Krzysztof Kurdyka, Chris Miller 0001, Patrick Speissegger |
Expansions of the real field by open sets: definability versus interpretability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 75(4), pp. 1311-1325, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Itaï Ben Yaacov |
Definability of groups in Alef0-stable metric structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 75(3), pp. 817-840, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Kentaro Fujimoto |
Relative truth definability of axiomatic truth theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bull. Symb. Log. ![In: Bull. Symb. Log. 16(3), pp. 305-344, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Hassan Sfouli |
Definability and nondefinability results for certain o-minimal structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 56(5), pp. 503-507, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Jerzy W. Grzymala-Busse, Wojciech Rzasa |
Definability and Other Properties of Approximations for Generalized Indiscernibility Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. Rough Sets ![In: Transactions on Rough Sets XI, pp. 14-39, 2010, Springer, 978-3-642-11478-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Matthew P. Szudzik |
On the definability of functionals in Gödel's theory T. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1011.6353, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
16 | Manuel Bodirsky, Michael Pinsker, Todor Tsankov |
Decidability of definability ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1012.2381, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
16 | Martin Grohe |
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1001.2572, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
16 | Facundo Carreiro |
Characterization and definability in modal first-order fragments ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1011.4718, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
16 | Alexandre A. M. Rodrigues, Ricardo C. Miranda Filho, Edelcio G. de Souza |
Definability in infinitary languages and invariance by automorphims. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reports Math. Log. ![In: Reports Math. Log. 45, pp. 119-133, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
16 | Hitoshi Kihara, Hiroakira Ono |
Interpolation Properties, Beth Definability Properties and Amalgamation Properties for Substructural Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 20(4), pp. 823-875, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Juha Kontinen |
Definability of second order generalized quantifiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 49(3), pp. 379-398, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Yongmei Liu 0001, Gerhard Lakemeyer |
On First-Order Definability and Computability of Progression for Local-Effect Actions and Beyond. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cognitive Robotics ![In: Cognitive Robotics, 21.02. - 26.02.2010, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
16 | Thomas Place, Luc Segoufin |
Deciding Definability in FO2(<) (or XPath) on Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, 11-14 July 2010, Edinburgh, United Kingdom, pp. 253-262, 2010, IEEE Computer Society, 978-0-7695-4114-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Trees, Logic, Xpath, Automata |
16 | Martin Grohe |
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, 11-14 July 2010, Edinburgh, United Kingdom, pp. 179-188, 2010, IEEE Computer Society, 978-0-7695-4114-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
graph minor theory, fixed-point logic, graph canonisation, descriptive complexity |
16 | Tomer Kotek, Johann A. Makowsky |
Definability of Combinatorial Functions and Their Linear Recurrence Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fields of Logic and Computation ![In: Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday, pp. 444-462, 2010, Springer, 978-3-642-15024-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Martin Grohe |
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fields of Logic and Computation ![In: Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday, pp. 328-353, 2010, Springer, 978-3-642-15024-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Gaëlle Fontaine, Thomas Place |
Frame Definability for Classes of Trees in the µ-calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings, pp. 381-392, 2010, Springer, 978-3-642-15154-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Oleg V. Kudinov, Victor L. Selivanov, Lyudmila V. Yartseva |
Definability in the Subword Order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Programs, Proofs, Processes, 6th Conference on Computability in Europe, CiE 2010, Ponta Delgada, Azores, Portugal, June 30 - July 4, 2010. Proceedings, pp. 246-255, 2010, Springer, 978-3-642-13961-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Erich Grädel |
Definability in Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010. Proceedings, pp. 19-21, 2010, Springer, 978-3-642-15204-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Dimiter Vakarelov |
Algorithmic Definability and Completeness in Modal Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoIKS ![In: Foundations of Information and Knowledge Systems, 6th International Symposium, FoIKS 2010, Sofia, Bulgaria, February 15-19, 2010. Proceedings, pp. 6-8, 2010, Springer, 978-3-642-11828-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Hannu Niemistö |
Zero-one law and definability of linear order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 74(1), pp. 105-123, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | John Chisholm, Ekaterina B. Fokina, Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Sara Quinn |
Intrinsic bounds on complexity and definability at limit levels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 74(3), pp. 1047-1060, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Selma Djelloul |
Treewidth and logical definability of graph products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 410(8-10), pp. 696-710, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Balder ten Cate, David Gabelaia, Dmitry Sustretov |
Modal languages for topology: Expressivity and definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 159(1-2), pp. 146-170, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Oleg V. Kudinov, Victor L. Selivanov, Anton V. Zhukov |
Definability in the h-quasiorder of labeled forests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 159(3), pp. 318-332, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Juha Kontinen, Jouko A. Väänänen |
On Definability in Dependence Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Lang. Inf. ![In: J. Log. Lang. Inf. 18(3), pp. 317-332, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Joseph Y. Halpern, Dov Samet, Ella Segev |
On Definability in Multimodal Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Rev. Symb. Log. ![In: Rev. Symb. Log. 2(3), pp. 451-468, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Margarita V. Korovina, Oleg V. Kudinov |
The Uniformity Principle for Sigma-definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 19(1), pp. 159-174, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Ross Willard |
PP-DEFINABILITY IS CO-NEXPTIME-COMPLETE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
The Constraint Satisfaction Problem: Complexity and Approximability ![In: The Constraint Satisfaction Problem: Complexity and Approximability, 25.10. - 30.10.2009, 2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
16 | Chien-Chung Chan, Fengming Michael Chang |
On Definability of Sets in Dominance-Based Approximation Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SMC ![In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, San Antonio, TX, USA, 11-14 October 2009, pp. 2953-2958, 2009, IEEE, 978-1-4244-2794-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Hristo Ganchev |
Definability in the Local Theory of the omega-Enumeration Degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings, pp. 242-249, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Martin Grohe |
Fixed-Point Definability and Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings, pp. 20-23, 2009, Springer, 978-3-642-04026-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Yongmei Liu 0001, Gerhard Lakemeyer |
On First-Order Definability and Computability of Progression for Local-Effect Actions and Beyond. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009, pp. 860-866, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
16 | José Raymundo Marcial-Romero, José Antonio Hernández Servín |
Functional first order de definability of LRTp. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LA-NMR ![In: Proceedings of the Fifth Latin American Workshop on Non-Monotonic Reasoning 2009 (LANMR'09) , Facultad de Ciencias Básicas, Ingeniería y Tecnología , Universidad Autónoma de Tlaxcala (UAT) , Apizaco, Tlaxcala, México, November 5-6, 2009., pp. 40-60, 2009, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
16 | Itay Neeman |
Finite state automata and monadic definability of singular cardinals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 73(2), pp. 412-438, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Jérôme Lang, Pierre Marquis |
On propositional definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. ![In: Artif. Intell. 172(8-9), pp. 991-1017, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Andrei S. Morozov, Margarita V. Korovina |
On sigma-definability without equality over the real numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 54(5), pp. 535-544, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Paul B. Larson |
Martin's Maximum and definability in H(xaleph2). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 156(1), pp. 110-122, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Andrey Bovykin |
Resplendent models and S11{\Sigma_1^1} -definability with an oracle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 47(6), pp. 607-623, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) Primary 03B10, 03C50, 03C62, Secondary 03C07, 03C30, 03C35, 03C52, 03C64, 03C57 |
16 | Miguel Couceiro, Lauri Hella, Jari Kivelä |
Term Definable Classes of Boolean Functions and Frame Definability in Modal Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. J. IGPL ![In: Log. J. IGPL 16(1), pp. 43-73, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Tuan-Fang Fan, Churn-Jung Liau, Duen-Ren Liu |
Definability in Logic and Rough Set Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECAI ![In: ECAI 2008 - 18th European Conference on Artificial Intelligence, Patras, Greece, July 21-25, 2008, Proceedings, pp. 749-750, 2008, IOS Press, 978-1-58603-891-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Shin-ya Katsumata |
A Characterisation of Lambda Definability with Sums Via TT-Closure Operators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings, pp. 278-292, 2008, Springer, 978-3-540-87530-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Tsan-sheng Hsu, Churn-Jung Liau, Da-Wei Wang 0004 |
Logical Definability in Social Position Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GrC ![In: The 2008 IEEE International Conference on Granular Computing, GrC 2008, Hangzhou, China, 26-28 August 2008, pp. 35-38, 2008, IEEE, 978-1-4244-2512-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Miguel Couceiro, Stephan Foldes |
Functional Equations, Constraints, Definability of Function Classes, and Functions of Boolean Variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Cybern. ![In: Acta Cybern. 18(1), pp. 61-75, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
16 | Andrei S. Morozov, Margarita V. Korovina |
Remarks on Sigma-definability without the equality test over the Reals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCA ![In: Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, CCA 2007, Siena, Italy, June 16-18, 2007, pp. 305-313, 2007, Elsevier. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Pierre-Louis Curien |
Definability and Full Abstraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computation, Meaning, and Logic ![In: Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, pp. 301-310, 2007, Elsevier. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Byunghan Kim, Rahim Moosa |
Stable definability and generic relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 72(4), pp. 1163-1176, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Tom Bohman, Alan M. Frieze, Tomasz Luczak 0001, Oleg Pikhurko, Clifford D. Smyth, Joel Spencer, Oleg Verbitsky 0001 |
First-Order Definability of Trees and Sparse Random Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. Probab. Comput. ![In: Comb. Probab. Comput. 16(3), pp. 375-400, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Enrico Marchioni, Franco Montagna |
Complexity and Definability Issues in L Pi 1/2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 17(2), pp. 311-331, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Valentin Goranko, Alberto Zanardo |
From Linear to Branching-Time Temporal Logics: Transfer of Semantics and Definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. J. IGPL ![In: Log. J. IGPL 15(1), pp. 53-76, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Amitabha Roy 0001, Howard Straubing |
Definability of Languages by Generalized First-Order Formulas over N+. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 37(2), pp. 502-521, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Razvan Diaconescu, Marius Petria |
Abstract Beth definability in institutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 71(3), pp. 1002-1028, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | S. Barry Cooper |
Definability as hypercomputational effect. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 178(1), pp. 72-82, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Pascal Weil |
On the logical definability of certain graph and poset languages ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/cs/0609048, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
16 | Oleg Pikhurko, Helmut Veith, Oleg Verbitsky 0001 |
The first order definability of graphs: Upper bounds for quantifier depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 154(17), pp. 2511-2529, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Massimo Franceschet, Angelo Montanari, Adriano Peron, Guido Sciavicco |
Definability and decidability of binary predicates for time granularity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Log. ![In: J. Appl. Log. 4(2), pp. 168-191, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | James G. Raftery |
The equational definability of truth predicates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reports Math. Log. ![In: Reports Math. Log. 41, pp. 95-149, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
16 | Philippe Balbiani, Tinko Tinchev |
Definability Over the Class of all Partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 16(5), pp. 541-557, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Amitabha Roy 0001, Howard Straubing |
Definability of Languages by Generalized First-Order Formulas over (N, +). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings, pp. 489-499, 2006, Springer, 978-3-540-32301-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Thierry Joly |
On lambda-Definability I: the Fixed Model Problem and Generalizations of the Matching Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 65(1-2), pp. 135-151, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
16 | Johan van Benthem |
Minimal predicates, fixed-points, and definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 70(3), pp. 696-712, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Bradd Hart, Ziv Shami |
On the type-definability of the binding group in simple theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 70(2), pp. 379-388, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Sy D. Friedman |
Definability degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 51(5), pp. 448-449, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Hajnal Andréka, Judit X. Madarász, István Németi |
Mutual definability does not imply definitional equivalence, a simple example. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 51(6), pp. 591-597, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Oleg Verbitsky 0001 |
The first order definability of graphs with separators via the Ehrenfeucht game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 343(1-2), pp. 158-176, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Guram Bezhanishvili, Leo Esakia, David Gabelaia |
Some Results on Modal Axiomatization and Definability for Topological Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 81(3), pp. 325-355, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
topological semantics, submaximal spaces, Modal logic |
16 | Fernando Tohmé |
Existence and definability of states of the world. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Soc. Sci. ![In: Math. Soc. Sci. 49(1), pp. 81-100, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Jerzy W. Grzymala-Busse |
Incomplete Data and Generalization of Indiscernibility Relation, Definability, and Approximations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSFDGrC (1) ![In: Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 10th International Conference, RSFDGrC 2005, Regina, Canada, August 31 - September 3, 2005, Proceedings, Part I, pp. 244-253, 2005, Springer, 3-540-28653-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Iskander Sh. Kalimullin |
On the Problems of Definability in the Enumeration Degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings, pp. 221-222, 2005, Springer, 3-540-26179-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Douglas A. Cenzer, Jeffrey B. Remmel |
The Complexity of Inductive Definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings, pp. 75-85, 2005, Springer, 3-540-26179-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Marek Zaionc |
Probabilistic Approach to the Lambda Definability for Fourth Order Types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CLA ![In: Proceedings of the Second Workshop on Computational Logic and Applications, CLA 2004, Lyon, France, June 17-18, 2004, pp. 41-54, 2004, Elsevier. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|