- E-mailMichal.Walicki@uib.no
- Phone+47 55 58 41 78
- Visitor AddressHIB - Thormøhlens gate 555006 Bergen
- Postal AddressPostboks 78035020 Bergen
Textbook
- (2016). Introduction to Mathematical Logic. World Scientific.
- (2012). Introduction to mathematical logic. World Scientific.
Academic article
- (2022). Paraconsistent resolution. Australasian Journal of Logic.
- (2022). Extensions in graph normal form. Logic Journal of the IGPL. 101-123.
- (2019). Kernels of digraphs with finitely many ends. Discrete Mathematics. 473-486.
- (2017). Resolving infinitary paradoxes. Journal of Symbolic Logic (JSL). 709-723.
- (2014). Propositional discourse logic. Synthese. 863-899.
- (2012). Kernels in digraphs which are not kernel-perfect. Discrete Mathematics. 2498-2505.
- (2012). Finding kernels or solving SAT. Journal of Discrete Algorithms. 146-164.
- (2012). Expressive power of digraph solvability. Annals of Pure and Applied Logic. 200-213.
- (2011). Sequence partitioning for process mining with unlabeled event logs. Data & Knowledge Engineering. 821-841.
- (2010). Mining Sequences for Patterns with Non-Repeating Symbols. IEEE Transactions on Evolutionary Computation. 8 pages.
- (2009). Reference, paradoxes and truth. Synthese. 195-226.
- (2009). Developing bounded reasoning. Journal of Logic, Language and Information. 97-129.
- (2008). Complete axiomatisations of properties of finite sets. Logic Journal of the IGPL. 293-313.
- (2007). Modalities as interactions between the classical and the intuitionistic logics. Logic and Logical Philosophy. 193-215.
- (2007). Completeness and Decidability in Sequence Logic. Lecture Notes in Computer Science (LNCS). 123-137.
- (2006). Strongly complete axiomatizations of "knowing at most" in syntactic structures. Lecture Notes in Computer Science (LNCS). 57-76.
- (2006). Quantifier-free logic for nondeterministic theories. Theoretical Computer Science. 13 pages.
- (2006). Complete axiomatizations of finite syntactic epistemic states. Lecture Notes in Computer Science (LNCS). 33-50.
- (2005). Bireachability and Final Multialgebras. Lecture Notes in Computer Science (LNCS). 408-423.
- (2004). Combining specification formalisms in the "general logic" of multialgebras. Lecture Notes in Computer Science (LNCS). 328-342.
- (2004). Combining specification formalisms in the "general logic" of multialgebras. Lecture Notes in Computer Science (LNCS). 328-342.
- (2003). Quantifier-free logic for multialgebraic theories. Electronical Notes in Theoretical Computer Science. 1-13.
- (2003). Combining Specification Formalisms in the General Logic of Multialgebras. Lecture Notes in Computer Science (LNCS). 328-342.
- (2002). Composotion and refinement of specifications of parameterized data types. Electronical Notes in Theoretical Computer Science. 1-18.
- (2001). Specification of parameterized programs - persistency revisited. Nordic Journal of Computing. 298-323.
- (2001). Computation Algebras. Mathematical Structures in Computer Science. 597-636.
- (2000). Modeling partiality by nondeterminism. Norsk Informatikk Konferanse, Bodø. ?.
- (1997). Singular and Plural Nondeterministic Parameters. SIAM journal on computing (Print).
- (1997). Algebraic Approaches to Nondeterminism: an Overview. ACM Computing Surveys.
- (1996). Singular and Plural Nondeterministic Parameters. SIAM journal on computing (Print).
- (1995). Structured specifications and Implementation of Nondeterministic Data Types. Nordic Journal of Computing. 358-395.
- (1995). Complete Calculus for the Multialgebraic and Functional Semantics of Nondeterminism. ACM Transactions on Programming Languages and Systems. 366-393.
Report
- (2010). Expressive power of digraph solvability. .
- (2006). Universal Multialgebra II. .
- (2006). Universal Multialgebra. .
- (2006). Modalities as Interactions between Classical and Intuitionistic Logics. .
- (2006). A category for studying the standardization of reporting languages. .
- (2006). A Category for Studying the Standardization of Reporting Languages. 314. 314. .
- (2002). Quantifier-free logic for multialgebraic theories. 228. 228. .
- (2002). Only Explicitly Knowing. 224. 224. .
- (2002). Logic with equality for multialgebras - an application of Rasiowa-Sikorski technique. 227. 227. .
- (2000). The institution of multialgebras. .
- (2000). The institution of multialgebras. .
- (1999). Modeling partiality by nondeterminism - from abstract specifications to flexible error handling. .
- (1999). Modeling partiality by nondeterminism - from abstract specifications to flexible error handling. .
- (1999). A logic of set-valued functions: Cut-elimination and other improvements. .
- (1997). Ralations, Multialgebras and Homomorphisms. 838. 838. .
- (1996). Communication Algebras. .
- (1995). Nondeterministic Operators in Algebraic Frameworks. CSL-TR-. CSL-TR-. .
- (1995). Algebraic Approaches to Nondeterminism - an Overview. 104. 104. .
- (1994). Singular and Plural Nondeterministic Parameters. 96. 96. .
- (1994). Reasoning and Rewriting with Set-Relations l: Ground Completeness. 92. 92. .
- (1993). Calculi for algebraic specification of nondeterminism; three completeness results. 75. 75. .
- (1992). Calculii for non-deterministic specifications: Three completeness results. .
- (1991). The Stanford Ada Style Checker. .
Popular scientific lecture
- (1995). Refinement of Nondeterministic Data Types.
- (1995). Reasoning and Rewriting with Set-Relations II: The Non-Ground Case Completeness.
- (1995). Communication Algebras.
- (1994). Multialgebras and Logics for Nondeterminism.
- (1994). Implementation of Nondeterministic Data Types.
Academic lecture
- (2007). Sekvenslogikk.
- (2007). Completeness and Decidability in Sequence Logic.
- (2006). Decidability and Completeness of Sequence Logic.
- (2006). A strongly complete logic of dense time intervals.
- (2005). Strongly Complete Axiomatizations of ``Knowing At Most`` in Standard Syntactic Assignments.
- (2005). Complete axiomatizations of finite syntactic epistemic states.
- (2005). Bireachability and Final Multialgebras.
- (2004). Syntactic Knowledge: A Logic of Reasoning, Communication and Cooperation.
- (2004). A Note on Syntactic Characterization of Incomplete Information in {ATEL}.
- (2003). Quantifier-free logic for multialgebraic theories.
- (2003). Quantifier-free logic for multialgebraic theories.
- (2003). A logic for reasoning about agents with finite explicit knowledge.
- (2002). The general logic of multialgebras.
- (2002). Composition and refinement of specifications of parameterised data types.
- (2002). A Logic for Reasoning about Explicit Knowledge in Finite Agents.
- (2001). Specification of parameterized data types.
- (2001). Specification and Refinement of Parameterized Data Types.
- (2001). Nondeterminism vs. Underspecification.
- (2001). Modeling partiality by nondeterminism.
- (2001). Logic with equalities for multialgebras - an application of Rasiowa-Sikorski technique.
- (2001). Logic with Equality for Multialgebras (an application of Rasiowa-Sikorski technique),.
- (2001). Compositional homomorphisms of relational structures (modeled as multialgebras).
- (1997). Some Categories of Relations.
- (1997). Categories of Relational Structures.
- (1995). Nondeterministic Algebraic Specifications in Relational Syntax.
- (1995). Generated models and the w-rule: the nondeterministic case.
- (1994). Reasoning and Rewriting with Set-Relations I: Ground Completeness.
- (1994). On Specialization of derivations in axiomatic equality theories.
- (1994). Nondeterministic operators in a standard framework.
- (1994). Multialgebras, Power Algebras and Complete Calculi of identities and inclusions.
- (1994). Multialgebras, Power Algebras and Complete Calculi of identities and inclusions.
- (1993). Sets and nondeteerminism.
- (1993). Initially + nondeterminism implies junk.
- (1992). Multialgebras and computations: two algebraic semantics of nondeterminism.
- (1992). A deterministic semantics of nondeterminism.
- (1991). Towards an Equational Theory of Nondeterminism.
- (1991). A function oriented view of nondeterminism.
Compendium
- (1995). Introduction to Logic - Lecture Notes.
Masters thesis
- (2004). Generic proof checker.
Doctoral dissertation
- (2004). A Logic of Finite Syntactic Epistemic States.
- (1993). Algebraic specifications of nondeterminism. Avhandling, Dr.Scient.
Academic chapter/article/Conference paper
- (2009). Universal Multialgebra. 67 pages.
- (2009). Finite, Reasoning and Interacting Agents. 6 pages.
- (2006). The choice of standards for a reporting language.
- (2006). The Choice of Standards for a Reporting Language. 1 pages.
- (2006). A strongly complete logic of dense time intervals. 12 pages.
- (2006). A brief history of symbolic logic. 27 pages.
Poster
- (2005). A Logic of Syntactic Knowledge: Reasoning, Communication and Cooperation.
More information in national current research information system (CRIStin)