相关论文: The hardest logic puzzle ever becomes even tougher

This paper addresses the problem of merging uncertain information in the framework of possibilistic logic. It presents several syntactic combination rules to merge possibilistic knowledge bases, provided by different sources, into a new…

The semantics for counterfactuals due to David Lewis has been challenged on the basis of unlikely, or impossible, events. Such events may skew a given similarity order in favour of those possible worlds which exhibit them. By updating the…

As large language models (LLMs) are increasingly deployed to perform tasks with minimal human oversight, it is crucial that these models operate robustly. In particular, a model that can solve a given problem should not fail simply because…

Astrophysical paradoxes are the paradoxes of physics. The main motivation of a formulated paradox is clearly recognized in the scientific environment because the phenomenon of a paradox itself has become interesting. There is an explanation…

We discuss a generalization of logic puzzles in which truth-tellers and liars are allowed to deviate from their pattern in case of one particular question: "Are you guilty?"

In the past century many fundamental results on unpredictability, undecidability and uncertainty have compelled scientists to grapple with the idea that some questions may never be resolved within our current theories. While this…

We discuss some old common knowledge puzzles and introduce a lot of new common knowledge puzzles.

I describe a puzzle I wrote for the 2018 MIT Mystery Hunt which introduced new types of people in logic puzzles. I discuss the puzzle itself, the solution, and the mathematics behind it.

In 1942 Haskell B.Curry presented what is now called Curry paradox which can be found in a logic independently of its stand on negation.In recent years there has been a revitalised interest in non-classical solutions to the semantic…

Negation as failure and incomplete information in logic programs have been studied by many researchers In order to explains HOW a negated conclusion was reached, we introduce and proof a different way for negating facts to overcoming…

The Halting Problem is a version of the Liar's Paradox.

Logics for knowledge representation suffer from over-specialization: while each logic may provide an ideal representation formalism for some problems, it is less than optimal for others. A solution to this problem is to choose from several…

We show undecidability of the satisfiability problem of what is arguably the simplest non-sub-Boolean modal logic with an implicit notion of binding. This work enriches the series of existing results of undecidability of modal logics with…

The Collatz conjecture is a famous math problem that was introduced by Lothar Collatz in 1937, and nobody has yet succeeded in proving or disproving it. In this article, I will analyze this problem with a new approach and I will discuss my…

This paper surveys main and recent studies on temporal logics in a broad sense by presenting various logic systems, dealing with various time structures, and discussing important features, such as decidability (or undecidability) results,…

In this article we prove the impossibility of some disentanglement puzzles, first building mathematical models that reflect the essential characteristics of these puzzles.

While looking for abductive explanations of a given set of manifestations, an ordering between possible solutions is often assumed. The complexity of finding/verifying optimal solutions is already known. In this paper we consider the…

Remarks on the life and work of Paul Erdos.

Fundamental discrepancy between first order logic and statistical inference (global versus local properties of universe) is shown to be the obstacle for integration of logic and probability in L.p. logic of Bacchus. To overcome the…

Boggle logic puzzles are based on the popular word game Boggle, where you are given list of words, and your goal is to recreate a Boggle board. In this paper we give an overview of known results and then propose a number of problems related…