|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 185 occurrences of 130 keywords
|
|
|
Results
Found 727 publication records. Showing 727 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
92 | Johann A. Makowsky |
Invariant Definability and P/poly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 12th International Workshop, CSL '98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 142-158, 1998, Springer, 3-540-65922-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
72 | Alexej P. Pynko |
A relative interpolation theorem for infinitary universal Horn logic and its applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 45(3), pp. 267-305, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Universal Horn theory, Interpolation theorem, Preservation theorem, Definability theorem |
67 | Margarita V. Korovina |
Computational Aspects of sigma-Definability over the Real Numbers without the Equality Test. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003, Proceedings, pp. 330-344, 2003, Springer, 3-540-40801-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
67 | Anuj Dawar, Lauri Hella, Phokion G. Kolaitis |
Implicit Definability and Infinitary Logic in Finite Model Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 22nd International Colloquium, ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings, pp. 624-635, 1995, Springer, 3-540-60084-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
63 | Alfredo Burrieza, Inman P. de Guzmán |
A Temporal × Modal Approach to the Definability of Properties of Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FroCoS ![In: Frontiers of Combining Systems, 4th International Workshop, FroCoS 2002, Santa Margherita Ligure, Italy, April 8-10, 2002, Proceedings, pp. 239-254, 2002, Springer, 3-540-43381-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
$Ttimes W$-semantics, functional semantics, completeness, definability |
54 | Yiyu Yao |
A Note on Definability and Approximations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. Rough Sets ![In: Trans. Rough Sets 7, pp. 274-282, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
54 | Jerzy W. Grzymala-Busse, Wojciech Rzasa |
Definability of Approximations for a Generalization of the Indiscernibility Relation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCI ![In: Proceedings of the IEEE Symposium on Foundations of Computational Intelligence, FOCI 2007, part of the IEEE Symposium Series on Computational Intelligence 2007, Honolulu, Hawaii, USA, 1-5 April 2007, pp. 65-72, 2007, IEEE, 1-4244-0703-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
54 | Leonid Libkin, Frank Neven |
Logical Definability and Query Languages over Unranked Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 22-25 June 2003, Ottawa, Canada, Proceedings, pp. 178-187, 2003, IEEE Computer Society, 0-7695-1884-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
54 | Damon Kaller |
Definability Equals Recognizability of Partial 3-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings, pp. 239-253, 1996, Springer, 3-540-62559-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
50 | Oleg V. Kudinov, Victor L. Selivanov |
Definability in the Infix Order on Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 13th International Conference, DLT 2009, Stuttgart, Germany, June 30 - July 3, 2009. Proceedings, pp. 454-465, 2009, Springer, 978-3-642-02736-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Infix order, least fixed point, biinterpretability, definability, automorphism, first-order theory |
50 | Oleg V. Kudinov, Victor L. Selivanov |
A Gandy Theorem for Abstract Structures and Applications to First-Order Definability. ![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. 290-299, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Gandy theorem, least fixed point, biinterpretability, labeled forest, h-quasiorder, definability |
50 | Marc Aiguier, Fabrice Barbier |
An Institution-independent Proof of the Beth Definability Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 85(3), pp. 333-359, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Beth definability, morphisms and comorphisms, inclusive category, institution theory, Craig interpolation |
50 | Larisa Maksimova |
Definability and Interpolation in Non-Classical Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 82(2), pp. 271-291, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
interpolation, modal logic, intuitionistic logic, definability, non-classical logics, amalgamation |
50 | Elisabeth Pelz |
About the concurrent behaviour of EN systems: definability and closure results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
European Workshop on Applications and Theory in Petri Nets ![In: Advances in Petri Nets 1989, covers the 9th European Workshop on Applications and Theory in Petri Nets, held in Venice, Italy in June 1988, selected papers, pp. 354-373, 1988, Springer, 3-540-52494-0. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
concurrent behaviour, partial word languages, logical specifications, monadic second order logic, definability, Elementary net systems |
47 | Matthias Baaz, Rosalie Iemhoff |
On Interpolation in Existence Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 12th International Conference, LPAR 2005, Montego Bay, Jamaica, December 2-6, 2005, Proceedings, pp. 697-711, 2005, Springer, 3-540-30553-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
existence predicate, Gentzen calculus, Beth definability, truth-value logics, Gödel logics, Scott logics, interpolation, cut-elimination, Intuitionistic logic, Kripke models, Skolemization |
47 | Marcelo P. Fiore |
Semantic analysis of normalisation by evaluation for typed lambda calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 4th international ACM SIGPLAN conference on Principles and practice of declarative programming, October 6-8, 2002, Pittsburgh, PA, USA (Affiliated with PLI 2002), pp. 26-37, 2002, ACM. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
categorical glueing, lambda definability, normalisation by evaluation, typed abstract syntax with variable binding, logical relations, typed lambda calculus, initial algebra semantics |
47 | Achim Blumensath, Erich Grädel |
Automatic Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, California, USA, June 26-29, 2000, pp. 51-62, 2000, IEEE Computer Society, 0-7695-0725-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
definability vs. complexity, logic, interpretability, Automata |
47 | Achim Blumensath |
Bounded Arithmetic and Descriptive Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 14th Annual Conference of the EACSL, Fischbachau, Germany, August 21-26, 2000, Proceedings, pp. 232-246, 2000, Springer, 3-540-67895-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
arithmetic, descriptive complexity, definability |
41 | Xavier Caicedo |
Definability and automorphisms in abstract logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 43(8), pp. 937-946, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
41 | Martin Grohe, Julian Mariño |
Definability and Descriptive Complexity on Databases of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT '99, 7th International Conference, Jerusalem, Israel, January 10-12, 1999, Proceedings., pp. 70-82, 1999, Springer, 3-540-65452-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
41 | Eugenia Ternovskaia |
Inductive Definability and the Situation Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Transactions and Change in Logic Databases ![In: Transactions and Change in Logic Databases, International Seminar on Logic Databases and the Meaning of Change, Schloss Dagstuhl, Germany, September 23-27, 1996 and ILPS '97 Post-Conference Workshop on (Trans)Actions and Change in Logic Programming and Deductive Databases, (DYNAMICS'97) Port Jefferson, NY, USA, October 17, 1997, Invited Surveys and Selected Papers, pp. 227-248, 1998, Springer, 3-540-65305-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
41 | Wojciech Buszkowski |
Approximation Spaces and Definability for Incomplete Information Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Rough Sets and Current Trends in Computing ![In: Rough Sets and Current Trends in Computing, First International Conference, RSCTC'98, Warsaw, Poland, June 22-26, 1998, Proceedings, pp. 115-122, 1998, Springer, 3-540-64655-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
41 | Stephen A. Fenner, Lance Fortnow, Lide Li |
Gap-Definability as a Closure Property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings, pp. 484-493, 1993, Springer, 3-540-56503-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
38 | Thierry Joly |
Encoding of the Halting Problem into the Monster Type & Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 6th International Conference, TLCA 2003, Valencia, Spain, June 10-12, 2003, Proceedings., pp. 153-166, 2003, Springer, 3-540-40332-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
38 | H. Imhof |
Logics that define their own semantics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 38(8), pp. 491-513, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
38 | Anil Seth |
Sharper Results on the Expressive Power of Generalized Quantifiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 17th Conference, Kharagpur, India, December 18-20, 1997, Proceedings, pp. 200-219, 1997, Springer, 3-540-63876-8. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
38 | Newton C. A. da Costa, Alexandre A. M. Rodrigues |
Definability and Invariance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 86(1), pp. 1-30, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Generalized Galois Theory, Invariance, Model Theory, Definability, Galois Theory |
38 | Oleg V. Kudinov, Victor L. Selivanov |
Definability in the Homomorphic Quasiorder of Finite Labeled Forests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 436-445, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
homomorphic quasiorder, atomic structure, definability, forest, automorphism, Labeled tree |
38 | Stefan Kahrs |
Limits of ML-Definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLILP ![In: Programming Languages: Implementations, Logics, and Programs, 8th International Symposium, PLILP'96, Aachen, Germany, September 24-27, 1996, Proceedings, pp. 17-31, 1996, Springer, 3-540-61756-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
completeness, ML, polymorphism, recursion, definability |
38 | Helmut Thiele |
On the Mutual Definability of Fuzzy Tolerance Relations and Fuzzy Tolerance Coverings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 25th IEEE International Symposium on Multiple-Valued Logic, ISMVL 1995, Bloomington, Indiana, USA, May 23-25, 1995, Proceedings, pp. 140-145, 1995, IEEE Computer Society, 0-8186-7118-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
tolerance analysis, mutual definability, fuzzy tolerance relations, fuzzy tolerance coverings, systems of sets, fixed universe, crisp set theory, bijections, fuzzy equivalence relations, crisp tolerance relations, crisp coverings, pattern recognition, cluster analysis, symmetry, fuzzy clusters, fuzzy set theory, equivalence classes, similarity relations, universal algebras, binary relations, reflexivity, fuzzy partitions, lattice isomorphisms |
34 | Marc Gyssens, Jan Paredaens, Dirk Van Gucht, George H. L. Fletcher |
Structural characterizations of the semantics of XPath as navigation tool on a document. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois, USA, pp. 318-327, 2006, ACM, 1-59593-318-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
XPath, expressibility, definability |
34 | Ranko Lazic 0001, David Nowak |
On a Semantic Definition of Data Independence . ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 6th International Conference, TLCA 2003, Valencia, Spain, June 10-12, 2003, Proceedings., pp. 226-240, 2003, Springer, 3-540-40332-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
nondeterminism, logical relations, Data independence, definability |
34 | Victor L. Selivanov |
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings, pp. 539-550, 2001, Springer, 3-540-41695-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Star-free regular languages, hierarchies, decidability, definability |
33 | Philippe Balbiani, Tinko Tinchev |
Decidable and Undecidable Problems for First-Order Definability and Modal Definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TbiLLC ![In: Language, Logic, and Computation - 13th International Tbilisi Symposium, TbiLLC 2019, Batumi, Georgia, September 16-20, 2019, Revised Selected Papers, pp. 214-236, 2019, Springer, 978-3-030-98478-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
33 | Juha Kontinen, Jakub Szymanik |
A characterization of definability of second-order generalized quantifiers with applications to non-definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 80(6), pp. 1152-1162, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
29 | Jing Shi |
Modal Expressivity and Definability over Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LORI ![In: Logic, Rationality, and Interaction, Second International Workshop, LORI 2009, Chongqing, China, October 8-11, 2009. Proceedings, pp. 323-324, 2009, Springer, 978-3-642-04892-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Michael Benedikt, Leonid Libkin, Frank Neven |
Logical definability and query languages over ranked and unranked trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 8(2), pp. 11, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Ranked trees, unranked trees, query languages, tree automata, model theory |
29 | Margarita V. Korovina, Oleg V. Kudinov |
The Uniformity Principle for Sigma -Definability with Applications to Computable Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 416-425, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Jan Rauch |
Definability of Association Rules in Predicate Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Foundations and Novel Approaches in Data Mining ![In: Foundations and Novel Approaches in Data Mining, pp. 23-40, 2006, Springer, 978-3-540-28315-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Clemens Grabmayer, Jan Willem Klop, Bas Luttik |
Some Remarks on Definability of Process Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2006 - Concurrency Theory, 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006, Proceedings, pp. 16-36, 2006, Springer, 3-540-37376-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Albert Atserias |
Definability on a Random 3-CNF Formula. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 26-29 June 2005, Chicago, IL, USA, Proceedings, pp. 458-466, 2005, IEEE Computer Society, 0-7695-2266-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Martin Grohe, György Turán |
Learnability and Definability in Trees and Similar Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 37(1), pp. 193-220, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
29 | Margarita V. Korovina |
Recent Advances in S-Definability over Continuous Data Types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ershov Memorial Conference ![In: Perspectives of Systems Informatics, 5th International Andrei Ershov Memorial Conference, PSI 2003, Akademgorodok, Novosibirsk, Russia, July 9-12, 2003, Revised Papers, pp. 238-247, 2003, Springer, 3-540-20813-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Dietmar Berwanger, Erich Grädel, Stephan Kreutzer |
Once upon a Time in a West - Determinacy, Definability, and Complexity of Path Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003, Proceedings, pp. 229-243, 2003, Springer, 3-540-20101-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Antonio Bucciarelli, Benjamin Leperchey, Vincent Padovani |
Relative Definability and Models of Unary PCF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 6th International Conference, TLCA 2003, Valencia, Spain, June 10-12, 2003, Proceedings., pp. 75-89, 2003, Springer, 3-540-40332-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Massimo Franceschet, Angelo Montanari, Adriano Peron, Guido Sciavicco |
Definability and decidability of binary predicates for time granularity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TIME ![In: 10th International Symposium on Temporal Representation and Reasoning / 4th International Conference on Temporal Logic (TIME-ICTL 2003), 8-10 July 2003, Cairns, Queensland, Australia, pp. 192-202, 2003, IEEE Computer Society, 0-7695-1912-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Mauro Ferrari 0002, Camillo Fiorentini, Guido Fiorino |
On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 9th International Conference, LPAR 2002, Tbilisi, Georgia, October 14-18, 2002, Proceedings, pp. 175-189, 2002, Springer, 3-540-00010-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Martin Grohe, György Turán |
Learnability and Definability in Trees and Similar Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings, pp. 645-658, 2002, Springer, 3-540-43283-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Lotfi A. Zadeh |
Toward a Theory of Hierarchical Definability (THD). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Rough Sets and Current Trends in Computing ![In: Rough Sets and Current Trends in Computing, Third International Conference, RSCTC 2002, Malvern, PA, USA, October 14-16, 2002, Proceedings, pp. 10-12, 2002, Springer, 3-540-44274-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Alexandra Shlapentokh |
Diophantine definability over non-finitely generated non-degenerate modules of algebraic extensions of Q. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 40(4), pp. 297-328, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 03C57, 03D35, 11D57, 11U05 |
29 | Foto N. Afrati, Hans Leiß, Michel de Rougemont |
Definability and Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, California, USA, June 26-29, 2000, pp. 63-73, 2000, IEEE Computer Society, 0-7695-0725-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Lempel-Ziv, compression, logic |
29 | Michael Benedikt, H. Jerome Keisler |
Definability over Linear Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 14th Annual Conference of the EACSL, Fischbachau, Germany, August 21-26, 2000, Proceedings, pp. 217-231, 2000, Springer, 3-540-67895-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
29 | Eva Hoogland, Maarten Marx, Martin Otto 0001 |
Beth Definability for the Guarded Fragment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic Programming and Automated Reasoning, 6th International Conference, LPAR'99, Tbilisi, Georgia, September 6-10, 1999, Proceedings, pp. 273-285, 1999, Springer, 3-540-66492-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
29 | Marcelo P. Fiore, Alex K. Simpson |
Lambda Definability with Sums via Grothendieck Logical Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 4th International Conference, TLCA'99, L'Aquila, Italy, April 7-9, 1999, Proceedings, pp. 147-161, 1999, Springer, 3-540-65763-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
29 | Helmut Thiele |
On the Mutual Definability of Classes of Generalized Fuzzy Implications and of Classes of Generalized NegationsandS-Norms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 27th IEEE International Symposium on Multiple-Valued Logic, ISMVL 1997, Antigonish, Nova Scotia, Canada, May 28-30, 1997, Proceedings, pp. 183-188, 1997, IEEE Computer Society, 0-8186-7910-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
S-implications, S-norms, R-implications, QL-implications, negations, T-norms |
29 | Arnold L. Rosenberg |
On the Independence of Real-Time Definability and Certain Structural Properties of Context-Free Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 15(4), pp. 672-679, 1968. The full citation details ...](Pics/full.jpeg) |
1968 |
DBLP DOI BibTeX RDF |
|
25 | Christian Glaßer, Stephen D. Travers |
Machines that Can Output Empty Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 44(3), pp. 369-390, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Leaf languages, Gap theorems, Computational complexity, Polynomial-time hierarchy |
25 | Martin Grohe |
Definable Tree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA, pp. 406-417, 2008, IEEE Computer Society, 978-0-7695-3183-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
fixed point logic, descriptive complexity, tree decomposition |
25 | Albert Atserias, Andrei A. Bulatov, Anuj Dawar |
Affine Systems of Equations and Counting Infinitary Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pp. 558-570, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Yiyu Yao, Yaohua Chen |
Rough Set Approximations in Formal Concept Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. Rough Sets ![In: Transactions on Rough Sets V, pp. 285-305, 2006, Springer, 3-540-39382-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Christian Glaßer, Stephen D. Travers |
Machines that Can Output Empty Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, pp. 436-446, 2006, Springer, 3-540-37791-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Margarita V. Korovina, Oleg V. Kudinov |
Towards Computability of Higher Type Continuous Data. ![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. 235-241, 2005, Springer, 3-540-26179-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Kerkko Luosto |
Equicardinality on Linear Orders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 14-17 July 2004, Turku, Finland, Proceedings, pp. 458-465, 2004, IEEE Computer Society, 0-7695-2192-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Ramon Jansana |
Leibniz Filters Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 75(3), pp. 305-317, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Weakly algebraizable logics, global and local consequence relations, Protoalgebraic logics |
25 | Víctor Dalmau, Phokion G. Kolaitis, Moshe Y. Vardi |
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2002, 8th International Conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002, Proceedings, pp. 310-326, 2002, Springer, 3-540-44120-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Martin Otto 0001 |
The Logic of Explicitly Presentation-Invariant Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 10th International Workshop, CSL '96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21-27, 1996, Selected Papers, pp. 369-384, 1996, Springer, 3-540-63172-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
generic computation, Circuit complexity, finite model theory |
25 | Marek Zaionc |
Lambda Representation of Operations Between Fifferent Term Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 8th International Workshop, CSL '94, Kazimierz, Poland, September 25-30, 1994, Selected Papers, pp. 91-105, 1994, Springer, 3-540-60017-5. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
25 | Stéphane Grumbach |
A Paradox in Database Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT'92, 4th International Conference, Berlin, Germany, October 14-16, 1992, Proceedings, pp. 312-325, 1992, Springer, 3-540-56039-4. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
25 | Uschi Heuter |
First-Order Properties of Trees, Star-Free Expressions, adn Aperiodicity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 88, 5th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 11-13, 1988, Proceedings, pp. 136-148, 1988, Springer, 3-540-18834-7. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
25 | Daniel Leivant, Tim Fernando |
Skinny and Fleshy Failures of Relative Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, Munich, Germany, January 21-23, 1987, pp. 246-252, 1987, ACM Press, 0-89791-215-2. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
21 | Balder ten Cate, Phokion G. Kolaitis |
Structural characterizations of schema-mapping languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT 2009, 12th International Conference, St. Petersburg, Russia, March 23-25, 2009, Proceedings, pp. 63-72, 2009, ACM, 978-1-60558-423-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
data integration, data exchange, schema mapping, definability |
21 | Juha Kontinen, Jakub Szymanik |
A Remark on Collective Quantification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Lang. Inf. ![In: J. Log. Lang. Inf. 17(2), pp. 131-140, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Collective quantification, Lindström quantifiers, Second-order generalized quantifiers, Type-shifting, Computational complexity, Definability |
21 | Maarten Marx |
Queries determined by views: pack your views. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 11-13, 2007, Beijing, China, pp. 23-30, 2007, ACM, 978-1-59593-685-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
views, query rewriting, definability, guarded fragment |
21 | Willem J. Blok, Eva Hoogland |
The Beth Property in Algebraic Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 83(1-3), pp. 49-90, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
equivalential logics, Beth definability property, epimorphisms, algebraizable logics, Abstract algebraic logic |
21 | Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin |
Definable relations and first-order query languages over strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 50(5), pp. 694-751, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
first-order definability, query languages, Strings, expressive power, quantifier elimination |
21 | Johan van Benthem |
Time, logic and computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
REX Workshop ![In: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30 - June 3, 1988, Proceedings, pp. 1-49, 1988, Springer, 3-540-51080-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
first-order definability, period structure, point structure, Completeness, correspondence, event structure, temporal operator, computational semantics, tense logic |
21 | Patrick Bellot |
Unformly Applicative Structures, A Theory of Computability and Polyadic Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Eighth Conference, Pune, India, December 21-23, 1988, Proceedings, pp. 270-285, 1988, Springer, 3-540-50517-2. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
polyadicity, algorithmic, abstraction, computability, representability, recursive function, definability |
16 | Gabriel Goldberg |
Strongly compact cardinals and ordinal definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Math. Log. ![In: J. Math. Log. 24(1), pp. 2250010:1-2250010:22, April 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Benedikt Pago |
Choiceless Computation and Symmetry: Limitations of Definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2401.07147, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Lucas Bueri, Radu Iosif, Florian Zuleger |
Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.16150, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Jan Heuer, Christoph Wernhard |
Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.07696, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Lekshmi Kamal K. Sheela, Manoj Changat, Jeny Jacob |
The Weak-Toll Function of a Graph: Axiomatic Characterizations and First-Order Non-definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CALDAM ![In: Algorithms and Discrete Applied Mathematics - 10th International Conference, CALDAM 2024, Bhilai, India, February 15-17, 2024, Proceedings, pp. 286-301, 2024, Springer, 978-3-031-52212-3. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Keith A. Kearnes |
Relative Maltsev definability of some commutator properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Algebra Comput. ![In: Int. J. Algebra Comput. 33(3), pp. 391-433, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Lothar Sebastian Krapp, Salma Kuhlmann, Moritz Link |
Definability of Henselian Valuations by conditions on the Value Group. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 88(3), pp. 1064-1082, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Martin Grohe, Daniel Neuen |
Canonisation and Definability for Graphs of Bounded Rank Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 24(1), pp. 6:1-6:31, January 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Derek Levinson |
John Steel and Hugh Woodin. HOD as a Core Model. Ordinal Definability and Recursion Theory: The Cabal Seminar, Volume III, edited by Alexander Kechris, Benedikt Lowe, and John Steel, Lecture Notes in Logic, vol. 3, Cambridge University Press, Cambridge, pp. 257-345. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bull. Symb. Log. ![In: Bull. Symb. Log. 29(4), pp. 656-657, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Juha Kontinen, Yasir Mahmood 0002, Arne Meier, Heribert Vollmer |
Parameterized Complexity of Weighted Team Definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.00541, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Miguel Campercholi, Mauricio Tellechea, Pablo Ventura |
Two algorithms to decide Quantifier-free Definability in Finite Algebraic Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.17017, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Zoltan A. Kocsis |
Proof-theoretic methods in quantifier-free definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.03640, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Benedetto Intrigila, Giulio Manzonetto, Nicolas Munnich |
Extended Addressing Machines, explicit substitutions, PCF, definability, full abstraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.13756, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Dino Mandrioli, Matteo Pradella, Stefano Crespi-Reghizzi |
Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 19(4), 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
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) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 19(4), 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Sebastian Maneth, Helmut Seidl, Martin Vu |
Definability Results for Top-Down Tree Transducers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Found. Comput. Sci. ![In: Int. J. Found. Comput. Sci. 34(2&3), pp. 253-287, February & April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Guillermo Badia, Xavier Caicedo, Carles Noguera |
Frame definability in finitely valued modal logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 174(7), pp. 103273, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Farmer Schlutzenberg |
The definability of E in self-iterable mice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 174(2), pp. 103208, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Jeny Jacob, Manoj Changat |
Segment Transit Function of the Induced Path Function of Graphs and Its First-Order Definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLA ![In: Logic and Its Applications - 10th Indian Conference, ICLA 2023, Indore, India, March 3-5, 2023, Proceedings, pp. 117-129, 2023, Springer, 978-3-031-26688-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Jean-Marie Lagniez, Pierre Marquis |
Boosting Definability Bipartition Computation Using SAT Witnesses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JELIA ![In: Logics in Artificial Intelligence - 18th European Conference, JELIA 2023, Dresden, Germany, September 20-22, 2023, Proceedings, pp. 697-711, 2023, Springer, 978-3-031-43618-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Alexis Bès, Christian Choffrut |
Decidability of Definability Issues in the Theory of Real Addition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 188(1), pp. 15-39, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Haim Horowitz, Saharon Shelah |
κ-Madness and definability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 68(3), pp. 346-351, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Yana Rumenova, Tinko Tinchev |
Modal Definability: Two Commuting Equivalence Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Logica Universalis ![In: Logica Universalis 16(1-2), pp. 177-194, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 727 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ >>] |
|