6 found
Sort by:
  1. Sjur Dyrkolbotn & Michał Walicki (2013). Propositional Discourse Logic. Synthese:1-37.
    A novel normal form for propositional theories underlies the logic pdl, which captures some essential features of natural discourse, independent from any particular subject matter and related only to its referential structure. In particular, pdlallows to distinguish vicious circularity from the innocent one, and to reason in the presence of inconsistency using a minimal number of extraneous assumptions, beyond the classical ones. Several, formally equivalent decision problems are identified as potential applications: non-paradoxical character of discourses, admissibility of arguments in argumentation (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  2. Marc Bezem, Clemens Grabmayer & Michał Walicki (2012). Expressive Power of Digraph Solvability. Annals of Pure and Applied Logic 163 (3):200-213.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  3. Michał Walicki (2012). Introduction to Mathematical Logic. World Scientific.
    A history of logic -- Patterns of reasoning -- A language and its meaning -- A symbolic language -- 1850-1950 mathematical logic -- Modern symbolic logic -- Elements of set theory -- Sets, functions, relations -- Induction -- Turning machines -- Computability and decidability -- Propositional logic -- Syntax and proof systems -- Semantics of PL -- Soundness and completeness -- First order logic -- Syntax and proof systems of FOL -- Semantics of FOL -- More semantics -- Soundness and (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  4. Michał Walicki (2009). Reference, Paradoxes and Truth. Synthese 171 (1):195 - 226.
    We introduce a variant of pointer structures with denotational semantics and show its equivalence to systems of boolean equations: both have the same solutions. Taking paradoxes to be statements represented by systems of equations (or pointer structures) having no solutions, we thus obtain two alternative means of deciding paradoxical character of statements, one of which is the standard theory of solving boolean equations. To analyze more adequately statements involving semantic predicates, we extend propositional logic with the assertion operator and give (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  5. Michał Walicki, Marc Bezem & Wojtek Szajnkenig (2009). Developing Bounded Reasoning. Journal of Logic, Language and Information 18 (1):97-129.
    We introduce a three-tiered framework for modelling and reasoning about agents who (i) can use possibly complete reasoning systems without any restrictions but who nevertheless are (ii) bounded in the sense that they never reach infinitely many results and, finally, who (iii) perform their reasoning in time. This last aspect does not concern so much the time it takes for agents to actually carry out their reasoning, as the time which can bring about external changes in the agents’ states such (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  6. Michał Walicki (2008). Modalities as Interactions Between the Classical and the Intuitionistic Logics. Logic and Logical Philosophy 15 (3):193-215.
    We give an equivalent formulation of topological algebras, interpreting S4, as boolean algebras equipped with intuitionistic negation. The intuitionistic substructure—Heyting algebra—of such an algebra can be then seen as an “epistemic subuniverse”, and modalities arise from the interaction between the intuitionistic and classical negations or, we might perhaps say, between the epistemic and the ontological aspects: they are not relations between arbitrary alternatives but between intuitionistic substructures and one common world governed by the classical (propositional) logic. As an example of (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation