§

This chapter attempts to give a brief overview of nonclassical (-logic) theories of truth. Due to space limitations, we follow a victory-through-sacrifice policy: sacrifice details in exchange for clarity of big-picture ideas. This policy results in our giving all-too-brief treatment to certain topics that have dominated discussion in the non-classical-logic area of truth studies. (This is part...

We identify a class of paradoxes that are neither set-theoretical or semantical, but that seem to depend on intensionality. In particular, these paradoxes arise out of plausible properties of propositional attitudes and their objects. We try to explain why logicians have neglected these paradoxes, and to show that, like the Russell Paradox and the direct discourse Liar Paradox, these intensiona...

Here, by introducing a version of “Unexpected hanging paradox” we try to open a new way and a new explanation for paradoxes, similar to liar paradox. Also, we will show that we have a semantic situation which no syntactical logical system could support that. In the end, we propose a claim as a question. Based on this claim, having an axiomatic system for computability theory is not possible. In...

Can one extend crisp Peano arithmetic PA by a possibly many-valued predicate Tr(x) saying \x is true" and satisfying the \dequotation schema" ' Tr(') for all sentences '? This problem is investigated in the frame of Lukasiewicz innnitely valued logic.

This chapter attempts to give a brief overview of nonclassical (-logic) theories of truth. Due to space limitations, we follow a victory-through-sacrifice policy: sacrifice details in exchange for clarity of big-picture ideas. This policy results in our giving all-too-brief treatment to certain topics that have dominated discussion in the non-classical-logic area of truth studies. (This is part...

This position paper hypothesizes that humans are becoming smarter, not only when using ICT and AI tools, but on their own, particularly due to the progress of AI knowledge. As is common when demonstrating that one computing mechanism is stronger than another, we chose a well-known task – the unexpected hanging paradox –that humans were previously unable to resolve efficiently, but can now do so...