Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
16 | Pascal Baumann 0001, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche |
Existential Definability over the Subword Ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.15642, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Lucy Ham, Marcel Jackson |
Finite model theory for pseudovarieties and universal algebra: preservation, definability and complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2212.02653, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Raine Rönnholm |
On definability of team relations with k-invariant atoms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 173(10), pp. 103136, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Haim Horowitz, Saharon Shelah |
On the definability of mad families of vector spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 173(4), pp. 103079, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Diego Calvanese, Silvio Ghilardi, Alessandro Gianola, Marco Montali, Andrey Rivkin |
Combination of Uniform Interpolants via Beth Definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 66(3), pp. 409-435, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Takahiro Sawasaki, Katsuhiko Sano |
Corrigendum to: Frame definability, canonicity and cut elimination in common sense modal predicate logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 32(1), pp. 172, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Pascal Baumann 0001, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche |
Existential Definability over the Subword Ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)., pp. 7:1-7:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-222-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Ádám Kunos |
Definability in the Substructure Ordering of Finite Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 38(3), pp. 401-420, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Hajnal Andréka, István Németi |
Two-variable Logic has Weak, but not Strong, Beth Definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 86(2), pp. 785-800, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Shlomo Eshel, Itay Kaplan |
On uniform definability of types over finite sets for NIP formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Math. Log. ![In: J. Math. Log. 21(3), pp. 2150015:1-2150015:13, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Agi Kurucz, Vladislav Ryzhikov, Yury Savateev, Michael Zakharyaschev |
Deciding FO-definability of Regular Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.06202, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Sebastian Maneth, Helmut Seidl, Martin Vu |
Definability Results for Top-Down Tree Transducers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.14860, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Christof Löding, Sarah Winter |
Resynchronized Uniformization and Definability Problems for Rational Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.12508, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Martin Grohe, Daniel Neuen |
Isomorphism, canonization, and definability for graphs of bounded rank width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 64(5), pp. 98-105, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Luca Reggio |
Beth definability and the Stone-Weierstrass Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 172(8), pp. 102990, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Iskander Sh. Kalimullin, Alexander G. Melnikov, Antonio Montalbán |
Punctual definability on structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 172(8), pp. 102987, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Lázaro Alberto Larrauri |
Probabilities of first-order sentences on sparse random relational structures: An application to definability on random CNF formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 31(2), pp. 444-472, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Takahiro Sawasaki, Katsuhiko Sano |
Frame definability, canonicity and cut elimination in common sense modal predicate logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 31(8), pp. 1933-1958, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Hristo Ganchev, Andrey Sariev |
The automorphism group and definability of the jump operator in the ømega-enumeration degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 60(7), pp. 909-925, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Agi Kurucz, Vladislav Ryzhikov, Yury Savateev, Michael Zakharyaschev |
Deciding FO-definability of Regular Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAMiCS ![In: Relational and Algebraic Methods in Computer Science - 19th International Conference, RAMiCS 2021, Marseille, France, November 2-5, 2021, Proceedings, pp. 241-257, 2021, Springer, 978-3-030-88700-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Gianluca Cima, Federico Croce, Maurizio Lenzerini |
Query Definability and Its Approximations in Ontology-based Data Management. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1 - 5, 2021, pp. 271-280, 2021, ACM, 978-1-4503-8446-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Sebastian Maneth, Helmut Seidl, Martin Vu |
Definability Results for Top-Down Tree Transducers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DLT ![In: Developments in Language Theory - 25th International Conference, DLT 2021, Porto, Portugal, August 16-20, 2021, Proceedings, pp. 291-303, 2021, Springer, 978-3-030-81507-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Frank Wolter |
Living Without Beth and Craig: Explicit Definitions and Interpolants without Beth Definability and Craig Interpolation (Abstract of Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOQE@KR ![In: Proceedings of the Second Workshop on Second-Order Quantifier Elimination and Related Topics (SOQE 2021) associated with the 18th International Conference on Principles of Knowledge Representation and Reasoning (KR 2021), Online Event, November 4, 2021., pp. 14, 2021, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | David Toman 0001, Grant E. Wedell |
Projective Beth Definability and Craig Interpolation for Relational Query Optimization (Material to Accompany Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOQE@KR ![In: Proceedings of the Second Workshop on Second-Order Quantifier Elimination and Related Topics (SOQE 2021) associated with the 18th International Conference on Principles of Knowledge Representation and Reasoning (KR 2021), Online Event, November 4, 2021., pp. 1-13, 2021, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Benedikt Pago |
Choiceless Computation and Symmetry: Limitations of Definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: 29th EACSL Annual Conference on Computer Science Logic, CSL 2021, January 25-28, 2021, Ljubljana, Slovenia (Virtual Conference)., pp. 33:1-33:21, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-175-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | David Toman 0001, Grant E. Weddell |
FO Rewritability for OMQ using Beth Definability and Interpolation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Description Logics ![In: Proceedings of the 34th International Workshop on Description Logics (DL 2021) part of Bratislava Knowledge September (BAKS 2021), Bratislava, Slovakia, September 19th to 22nd, 2021, 2021, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Mikhail R. Starchak |
Positive Existential Definability with Unit, Addition and Coprimeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: ISSAC '21: International Symposium on Symbolic and Algebraic Computation, Virtual Event, Russia, July 18-23, 2021, pp. 353-360, 2021, ACM, 978-1-4503-8382-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Benjamin H. Feintzeig |
Correction to: Deduction and definability in infinite statistical systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Synth. ![In: Synth. 197(12), pp. 5539-5540, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Martin Fränzle, Karin Quaas, Mahsa Shirmohammadi, James Worrell 0001 |
Effective definability of the reachability relation in timed automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 153, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Marco Barone, Nicolás Caro, Eudes Naziazeno |
Uniform Definability of Integers in Reduced indecomposable Polynomial Rings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 85(4), pp. 1376-1402, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Jean-Marie Lagniez, Emmanuel Lonca, Pierre Marquis |
Definability for model counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. ![In: Artif. Intell. 281, pp. 103229, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Tin Perkov, Luka Mikec |
Existential definability of modal frame classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 66(3), pp. 316-325, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Tommaso Moraschini, James G. Raftery, Jamie J. Wannenburg |
Epimorphisms, Definability and Cardinalities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 108(2), pp. 255-275, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Mikolaj Bojanczyk |
Languages recognised by finite semigroups, and their generalisations to objects such as trees and graphs, with an emphasis on definability in monadic second-order logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2008.11635, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | Lázaro Alberto Larrauri |
Probabilities of first order sentences on sparse random relational structures: An application to definability on random CNF formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.06099, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | Dino Mandrioli, Matteo Pradella, Stefano Crespi-Reghizzi |
Aperiodicity, Star-freeness, and First-order Definability of Structured Context-Free Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.01236, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | Michal R. Przybylek |
Beyond sets with atoms: definability in first order logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2003.04803, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | |
An effective version of definability in metric model theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2003.02087, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | Ioannis Papantonis, Vaishak Belle |
On Constraint Definability in Tractable Probabilistic Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2001.11349, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | R. Ramanujam 0001, Ramanathan S. Thinniyam |
Definability in first-order theories of graph orderings ⋆. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 30(1), pp. 403-420, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Mikhail N. Rybakov, Dmitry Shkatov |
Recursive enumerability and elementary frame definability in predicate modal logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 30(2), pp. 549-560, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Carlos Areces, Miguel Campercholi, Daniel Penazzi, Pablo Ventura |
The complexity of definability by open first-order formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. J. IGPL ![In: Log. J. IGPL 28(6), pp. 1093-1105, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Dino Mandrioli, Matteo Pradella, Stefano Crespi-Reghizzi |
Star-Freeness, First-Order Definability and Aperiodicity of Structured Context-Free Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAC ![In: Theoretical Aspects of Computing - ICTAC 2020 - 17th International Colloquium, Macau, China, November 30 - December 4, 2020, Proceedings, pp. 161-180, 2020, Springer, 978-3-030-64275-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Diego Calvanese, Silvio Ghilardi, Alessandro Gianola, Marco Montali, Andrey Rivkin |
Combined Covers and Beth Definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAR (1) ![In: Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Paris, France, July 1-4, 2020, Proceedings, Part I, pp. 181-200, 2020, Springer, 978-3-030-51073-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Yijia Chen, Jörg Flum |
FO-Definability of Shrub-Depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: 28th EACSL Annual Conference on Computer Science Logic, CSL 2020, January 13-16, 2020, Barcelona, Spain., pp. 15:1-15:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-132-0. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Benjamin H. Feintzeig |
Deduction and definability in infinite statistical systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Synth. ![In: Synth. 196(5), pp. 1831-1861, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Ádám Kunos |
Definability in the Embeddability Ordering of Finite Directed Graphs, II. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 36(2), pp. 291-311, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Hristo Ganchev, Andrey Sariev |
Definability in the local structure of the ω-Turing degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Struct. Comput. Sci. ![In: Math. Struct. Comput. Sci. 29(7), pp. 927-937, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Lynn D'eer, Chris Cornelis |
Decision reducts and bireducts in a covering approximation space and their relationship to set definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Approx. Reason. ![In: Int. J. Approx. Reason. 109, pp. 42-54, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Marat Kh. Faizrahmanov, Asher M. Kach, Iskander Sh. Kalimullin, Antonio Montalbán, Vadim Puzarenko |
Jump inversions of algebraic structures and Σ-definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 65(1), pp. 37-45, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Viktor Verbovskiy |
On definability of types and relative stability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 65(3), pp. 332-346, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | William Chan 0002 |
Ordinal definability and combinatorics of equivalence relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Math. Log. ![In: J. Math. Log. 19(2), pp. 1950009:1-1950009:24, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Bruce E. Litow |
Existential Diophantine definability of string length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 776, pp. 114-116, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Mikhail N. Rybakov, Dmitry Shkatov |
Recursive enumerability and elementary frame definability in predicate modal logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1911.09473, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
16 | Martin Grohe, Daniel Neuen |
Canonisation and Definability for Graphs of Bounded Rank Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1901.10330, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
16 | Diego Calvanese, Silvio Ghilardi, Alessandro Gianola, Marco Montali, Andrey Rivkin |
Combined Covers and Beth Definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1911.07774, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
16 | Carlos Areces, Miguel Campercholi, Daniel Penazzi, Pablo Ventura |
The Complexity of Definability by Open First-Order Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1904.04637, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
16 | Martin Fränzle, Karin Quaas, Mahsa Shirmohammadi, James Worrell 0001 |
Effective Definability of the Reachability Relation in Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1903.09773, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
16 | Zuzana Haniková |
Implicit definability of truth constants in Łukasiewicz logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 23(7), pp. 2279-2287, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Michael Benedikt, Pierre Bourhis, Michael Vanden Boom |
Definability and Interpolation within Decidable Fixpoint Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 15(3), 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Katsuhiko Sano, Jonni Virtema |
Characterising modal definability of team-based logics via the universal modality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 170(9), pp. 1100-1127, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Antje Rumberg, Alberto Zanardo |
First-Order Definability of Transition Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Lang. Inf. ![In: J. Log. Lang. Inf. 28(3), pp. 459-488, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Grigory K. Olkhovikov |
Justification announcements in discrete time. Part II: Frame definability results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. J. IGPL ![In: Log. J. IGPL 27(5), pp. 671-692, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Martin Grohe, Daniel Neuen |
Canonisation and Definability for Graphs of Bounded Rank Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019, pp. 1-13, 2019, IEEE, 978-1-7281-3608-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Miguel Campercholi, Mauricio Tellechea, Pablo Ventura |
Deciding Quantifier-free Definability in Finite Algebraic Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LSFA ![In: Proceedings of the 14th Workshop on Logical and Semantic Frameworks with Applications, LSFA 2019, Natal, Brazil, August, 2019, pp. 23-41, 2019, Elsevier. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Valentin Cassano, Raul Fervari, Carlos Areces, Pablo F. Castro |
Interpolation and Beth Definability in Default Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JELIA ![In: Logics in Artificial Intelligence - 16th European Conference, JELIA 2019, Rende, Italy, May 7-11, 2019, Proceedings, pp. 675-691, 2019, Springer, 978-3-030-19569-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Yu-Ru Syau, En-Bing Lin, Churn-Jung Liau |
Neighborhood Systems: Rough Set Approximations and Definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 159(4), pp. 429-450, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Olivier Carton, Thomas Colcombet, Gabriele Puppis |
An Algebraic Approach to MSO-Definability on Countable linear Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 83(3), pp. 1147-1189, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Wei Wang 0150 |
Relative Definability of n-generics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 83(4), pp. 1345-1362, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Wied Pakusa, Svenja Schalthöfer, Erkal Selman |
Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 19(2), pp. 7:1-7:27, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Murat Diker, Aysegül Altay Ugur |
Dicovering approximation spaces and definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Approx. Reason. ![In: Int. J. Approx. Reason. 101, pp. 255-275, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Antonio Montalbán |
Coding and Definability in Computable Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Notre Dame J. Formal Log. ![In: Notre Dame J. Formal Log. 59(3), pp. 285-306, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Denis Bonnay, Fredrik Engström |
Invariance and Definability, with and without Equality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Notre Dame J. Formal Log. ![In: Notre Dame J. Formal Log. 59(1), pp. 109-133, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | R. Zoghifard, Massoud Pourmahdian |
First-Order Modal Logic: Frame Definability and a Lindström Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 106(4), pp. 699-720, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Zuzana Haniková |
Implicit definability of truth constants in Łukasiewicz logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1802.08588, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
16 | Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis |
One-way definability of two-way word transducers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 14(4), 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Andrew E. M. Lewis-Pye |
The search for natural definability in the Turing degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. ![In: Comput. 7(2-3), pp. 189-235, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Françoise Point |
Definability of types and VC density in differential topological fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 57(7-8), pp. 809-828, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Carlos Areces, Miguel Campercholi, Pablo Ventura |
Deciding Open Definability via Subisomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WoLLIC ![In: Logic, Language, Information, and Computation - 25th International Workshop, WoLLIC 2018, Bogota, Colombia, July 24-27, 2018, Proceedings, pp. 91-105, 2018, Springer, 978-3-662-57668-7. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Nathan Lhote |
Definability and synthesis of transductions. (Définissabilité et synthèse de transductions). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2018 |
RDF |
|
16 | Barry Jay, Jose Vergara |
Conflicting accounts of λ-definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Algebraic Methods Program. ![In: J. Log. Algebraic Methods Program. 87, pp. 1-3, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
16 | Vahagn Aslanyan |
Definability of Derivations in the Reducts of differentially closed Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 82(4), pp. 1252-1277, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
16 | Guillermo Badia |
Model Definability in Relevant Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FLAP ![In: FLAP 4(3), 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
16 | Lars Jaffke, Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle |
Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 66, pp. 191-234, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
16 | Zhiqiang Zhuang, Maurice Pagnucco, Yan Zhang 0003 |
Inter-Definability of Horn Contraction and Horn Revision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Philos. Log. ![In: J. Philos. Log. 46(3), pp. 299-332, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
16 | Wojciech Czerwinski, Claire David, Katja Losemann, Wim Martens |
Deciding definability by deterministic regular expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 88, pp. 75-89, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
16 | Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis |
One-way definability of two-way word transducers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1706.01668, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
16 | Samson Abramsky |
Intensionality, Definability and Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1705.04744, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
16 | Yijia Chen, Jörg Flum, Xuangui Huang |
Slicewise definability in first-order logic with bounded quantifier rank. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1704.03167, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
16 | Michael Benedikt, Pierre Bourhis, Michael Vanden Boom |
Characterizing Definability in Decidable Fixpoint Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1705.01823, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
16 | Dimiter Georgiev |
Definability in the class of all -frames - computability and complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Non Class. Logics ![In: J. Appl. Non Class. Logics 27(1-2), pp. 1-26, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
16 | Fan Yang 0004 |
Uniform Definability in Propositional Dependence Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Rev. Symb. Log. ![In: Rev. Symb. Log. 10(1), pp. 65-79, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
16 | Philippe Balbiani, Tinko Tinchev |
Undecidable problems for modal definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 27(3), pp. 901-920, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
16 | Sergio Abriola, María Emilia Descotte, Santiago Figueira |
Model theory of XPath on data trees. Part II: Binary bisimulation and definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 255, pp. 195-223, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
16 | Ramanathan S. Thinniyam |
Definability of Recursive Predicates in the Induced Subgraph Order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLA ![In: Logic and Its Applications - 7th Indian Conference, ICLA 2017, Kanpur, India, January 5-7, 2017, Proceedings, pp. 211-223, 2017, Springer, 978-3-662-54068-8. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
16 | Anuj Dawar, Pengming Wang 0001 |
Definability of semidefinite programming and lasserre lower bounds for CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017, pp. 1-12, 2017, IEEE Computer Society, 978-1-5090-3018-7. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
16 | Faried Abu Zaid, Anuj Dawar, Erich Grädel, Wied Pakusa |
Definability of summation problems for Abelian groups and semigroups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017, pp. 1-11, 2017, IEEE Computer Society, 978-1-5090-3018-7. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
16 | Michael Benedikt, Pierre Bourhis, Michael Vanden Boom |
Characterizing Definability in Decidable Fixpoint Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, pp. 107:1-107:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-041-5. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
16 | Nicolas Bacquey, Etienne Grandjean, Frédéric Olive |
Definability by Horn Formulas and Linear Time on Cellular Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, pp. 99:1-99:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-041-5. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
16 | Ping Lu 0007, Zhilin Wu, Haiming Chen |
The Complexity of SORE-definability Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark, pp. 22:1-22:15, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-046-0. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|