All Stories

  1. RESOLVING INFINITARY PARADOXES

    Article • Journal of Symbolic Logic, June 2017, Cambridge University Press

    Michal Walicki

  2. Introduction to Mathematical Logic

    Article • July 2015, World Scientific Pub Co Pte Lt

    Michal Walicki

  3. Propositional discourse logic

    Article • Synthese, May 2013, Springer Science + Business Media

    Michal Walicki

  4. Kernels in digraphs that are not kernel perfect

    Article • Discrete Mathematics, August 2012, Elsevier

    Michal Walicki

  5. Expressive power of digraph solvability

    Article • Annals of Pure and Applied Logic, March 2012, Elsevier

    Michal Walicki

  6. Finding kernels or solving SAT

    Article • Journal of Discrete Algorithms, January 2012, Elsevier

    Michal Walicki

  7. Introduction to Mathematical Logic

    Article • November 2011, World Scientific Pub Co Pte Lt

    Michal Walicki

  8. Sequence partitioning for process mining with unlabeled event logs

    Article • Data & Knowledge Engineering, October 2011, Elsevier

    Michal Walicki

  9. Mining sequences for patterns with non-repeating symbols

    Article • July 2010, Institute of Electrical & Electronics Engineers (IEEE)

    Michal Walicki

  10. Reference, paradoxes and truth

    Article • Synthese, September 2008, Springer Science + Business Media

    Michal Walicki

  11. Developing Bounded Reasoning

    Article • Journal of Logic Language and Information, July 2008, Springer Science + Business Media

    Michal Walicki

  12. Modalities as interactions between the classical and the intuitionistic logics

    Article • Logic and Logical Philosophy, March 2008, Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University

    Michal Walicki

  13. Complete Axiomatisations of Properties of Finite Sets

    Article • Logic Journal of IGPL, February 2008, Oxford University Press (OUP)

    Michal Walicki

  14. THE CHOICE OF STANDARDS FOR A REPORTING LANGUAGE

    Article • October 2006, World Scientific Pub Co Pte Lt

    Michal Walicki

  15. Quantifier-free logic for nondeterministic theories

    Article • Theoretical Computer Science, April 2006, Elsevier

    Michal Walicki

  16. A Category for Studying the Standardization of Reporting Languages

    Article • SSRN Electronic Journal, January 2006, Elsevier

    Michal Walicki

  17. Complete Axiomatizations of Finite Syntactic Epistemic States

    Article • January 2006, Springer Science + Business Media

    Michal Walicki

  18. Strongly Complete Axiomatizations of “Knowing at Most” in Syntactic Structures

    Article • January 2006, Springer Science + Business Media

    Michal Walicki

  19. Bireachability and Final Multialgebras

    Article • January 2005, Springer Science + Business Media

    Michal Walicki

  20. The Choice of Standards for a Reporting Language

    Article • SSRN Electronic Journal, January 2005, Elsevier

    Michal Walicki

  21. A logic of reasoning, communication and cooperation with syntactic knowledge

    Article • January 2005, ACM (Association for Computing Machinery)

    Michal Walicki

  22. Quantifier-free logic for multialgebraic theories

    Article • Electronic Notes in Theoretical Computer Science, September 2003, Elsevier

    Michal Walicki

  23. Combining Specification Formalisms in the ‘General Logic’ of Multialgebras

    Article • January 2003, Springer Science + Business Media

    Michal Walicki

  24. Composition and Refinement of Specifications of Parameterized Data Types

    Article • Electronic Notes in Theoretical Computer Science, November 2002, Elsevier

    Michal Walicki

  25. Computation Algebras

    Article • Mathematical Structures in Computer Science, September 2001, Cambridge University Press

    Michal Walicki

  26. Compositional Homomorphisms of Relational Structures

    Article • January 2001, Springer Science + Business Media

    Michal Walicki

  27. Categories of relational structures

    Article • January 1998, Springer Science + Business Media

    Michal Walicki

  28. Singular and Plural Nondeterministic Parameters

    Article • SIAM Journal on Computing, August 1997, Society for Industrial & Applied Mathematics (SIAM)

    Michal Walicki

  29. Algebraic approaches to nondeterminism---an overview

    Article • ACM Computing Surveys, March 1997, ACM (Association for Computing Machinery)

    Michal Walicki

  30. Rewriting and reasoning with set-relations II: The non-ground case completeness

    Article • January 1996, Springer Science + Business Media

    Michal Walicki

  31. A complete calculus for the multialgebraic and functional semantics of nondeterminism

    Article • ACM Transactions on Programming Languages and Systems, March 1995, ACM (Association for Computing Machinery)

    Michal Walicki

  32. Reasoning and rewriting with set-relations I: Ground completeness

    Article • January 1995, Springer Science + Business Media

    Michal Walicki

  33. Generated models and the ω-rule: The nondeterministic case

    Article • January 1995, Springer Science + Business Media

    Michal Walicki

  34. Multialgebras, power algebras and complete calculi of identities and inclusions

    Article • January 1995, Springer Science + Business Media

    Michal Walicki

  35. The Stanford Ada Style Checker: An Application of the Anna Tools and Methodology.

    Article • August 1991, Defense Technical Information Center (DTIC)

    Michal Walicki

  36. Completeness and Decidability in Sequence Logic

    Article • Springer Science + Business Media

    Michal Walicki