• Extensions in graph normal form 

      Walicki, Michal (Journal article; Peer reviewed, 2022)
      Graph normal form, introduced earlier for propositional logic, is shown to be a normal form also for first-order logic. It allows to view syntax of theories as digraphs, while their semantics as kernels of these digraphs. ...
    • Kernels of digraphs with finitely many ends 

      Walicki, Michal (Journal article; Peer reviewed, 2019)
      According to Richardson’s theorem, every digraph without directed odd cycles that is either (a) locally finite or (b) rayless has a kernel (an independent subset with an incoming edge from every vertex in ). We generalize ...
    • The Structure of Paradoxes in a Logic of Sentential Operators 

      Walicki, Michal (Journal article; Peer reviewed, 2024)
      Any language L of classical logic, of first- or higher-order, is expanded with sentential quantifiers and operators. The resulting language L+, capable of self-reference without arithmetic or syntax encoding, can serve as ...