| Publication | Date of Publication | Type |
|---|
Closure properties of synchronized relations
| 2022-07-18 | Paper |
Algorithmic identification of probabilities is hard
Journal of Computer and System Sciences | 2018-05-08 | Paper |
Bisimulations on Data Graphs
Journal of Artificial Intelligence Research | 2018-03-07 | Paper |
Axiomatizations for downward XPath on data trees
Journal of Computer and System Sciences | 2017-09-07 | Paper |
Model theory of XPath on data trees. II: Binary bisimulation and definability
Information and Computation | 2017-09-04 | Paper |
Logics of repeating values on data trees and branching counter systems
Lecture Notes in Computer Science | 2017-05-19 | Paper |
Counting the changes of random \(\Delta_2^0\) sets
Journal Of Logic And Computation | 2016-01-28 | Paper |
Linearizing well quasi-orders and bounding the length of bad sequences
Theoretical Computer Science | 2015-10-12 | Paper |
Model theory of XPath on data trees. I: Bisimulation and characterization
Journal of Artificial Intelligence Research | 2015-08-25 | Paper |
Feasible analysis, randomness, and base invariance
Theory of Computing Systems | 2015-07-20 | Paper |
Normality in non-integer bases and polynomial time randomness
Journal of Computer and System Sciences | 2015-07-13 | Paper |
Definability for downward and vertical XPath on data trees
Logic, Language, Information, and Computation | 2015-01-13 | Paper |
Characterization, definability and separation via saturated models
Theoretical Computer Science | 2014-06-10 | Paper |
Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Linearizing bad sequences: upper bounds for the product and majoring well quasi-orders
Logic, Language, Information and Computation | 2012-09-21 | Paper |
On the size of shortest modal descriptions
| 2012-08-05 | Paper |
Completeness results for memory logics
Annals of Pure and Applied Logic | 2012-04-10 | Paper |
The expressive power of memory logics
The Review of Symbolic Logic | 2011-10-21 | Paper |
Using logic in the generation of referring expressions
Logical Aspects of Computational Linguistics | 2011-07-01 | Paper |
Basic model theory for memory logics
Logic, Language, Information and Computation | 2011-05-27 | Paper |
On the expressive power of IF-logic with classical negation
Logic, Language, Information and Computation | 2011-05-27 | Paper |
Counting the changes of random \({\Delta}^0_2\) sets
Programs, Proofs, Processes | 2010-07-29 | Paper |
On the formal semantics of IF-like logics
Journal of Computer and System Sciences | 2010-07-08 | Paper |
On the computing power of fuzzy Turing machines
Fuzzy Sets and Systems | 2009-08-28 | Paper |
Indifferent Sets
Journal Of Logic And Computation | 2009-04-16 | Paper |
Completeness Results for Memory Logics
Logical Foundations of Computer Science | 2009-02-24 | Paper |
Classical Computability and Fuzzy Turing Machines
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Expressive Power and Decidability for Memory Logics
Logic, Language, Information and Computation | 2008-07-10 | Paper |
On the Formal Semantics of IF-Like Logics
Logic, Language, Information and Computation | 2008-07-10 | Paper |
Lowness properties and approximations of the jump
Annals of Pure and Applied Logic | 2008-03-28 | Paper |
Turing's unpublished algorithm for normal numbers
Theoretical Computer Science | 2007-06-06 | Paper |
Randomness and universal machines
Journal of Complexity | 2007-02-08 | Paper |
Randomness and halting probabilities
Journal of Symbolic Logic | 2007-01-19 | Paper |
Program size complexity for possibly infinite computations
Notre Dame Journal of Formal Logic | 2005-07-06 | Paper |
Kolmogorov complexity for possibly infinite computations
Journal of Logic, Language and Information | 2005-05-13 | Paper |
An example of a computable absolutely normal number
Theoretical Computer Science | 2002-03-03 | Paper |
