This is a preview. Log in through your library . Abstract We conducted a computer-based psychological experiment in which a random mix of 40 tautologies and 40 non-tautologies were presented to the ...

We attempt to define the classical propositional logic by use of appropriate derivability conditions called Cn-definitions. The conditions characterize basic properties of propositional connectives.

Modal logic, an extension of classical logic, investigates the modes of truth such as necessity and possibility. Its development has been closely intertwined with advances in proof theory, a field ...

Computational complexity and proof systems are fundamental areas in theoretical computer science that explore the limits of what can be computed and how efficiently problems can be solved. Recent ...