Published in Studia Logica
In this paper we analyze the propositional extensions of the minimal classical modal logic system E, which form a lattice denoted as CExtE. Our method of analysis uses algebraic calculations with canonical forms, which are a generalization of the normal forms applicable to normal modal logics. As an application, we identify a group of automorphisms...
Published in Studia Logica
We construct a machine that knows its own code, at the price of not knowing its own factivity.
Published in Studia Logica
Reinhardt’s conjecture, a formalization of the statement that a truthful knowing machine can know its own truthfulness and mechanicalness, was proved by Carlson using sophisticated structural results about the ordinals and transfinite induction just beyond the first epsilon number. We prove a weaker version of the conjecture, by elementary methods ...
Published in Studia Logica
The paper presents a new logic for reasoning about the formation of beliefs through perception or through inference in non-omniscient resource-bounded agents. The logic distinguishes the concept of explicit belief from the concept of background knowledge. This distinction is reflected in its formal semantics and axiomatics: (i) we use a non-standar...
Published in Studia Logica
Published in Studia Logica
Published in Studia Logica
Published in Studia Logica
We study how to postpone the application of the reductio ad absurdum rule (raa\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {raa}$$\end{document}) in classica...
Published in Studia Logica
Published in Studia Logica
This special issue on general proof theory collects papers resulting from the conference on general proof theory held in November 2015 in Tübingen.
