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

We describe the integration of logical and uncertain reasoning methods to identify the likely source and location of software problems. To date, software engineers have had few tools for identifying the sources of error in complex software…

In Boole's famous 1854 book {\em The Laws of Thought\/} the mathematical analysis of Aristotelian logic was relegated to Chapter XV, the last chapter before his treatment of probability theory. This chapter is Boole's tour de force to show…

Monsters lurk within mathematical as well as literary haunts. I propose to trace some pathways between these two monstrous habitats. I start from Jeffrey Jerome Cohen's influential account of monster culture and explore how well…

While extremely powerful and versatile at various tasks, the thinking capabilities of large language models (LLMs) are often put under scrutiny as they sometimes fail to solve problems that humans can systematically solve. However, recent…

We study the expressivity and the complexity of various logics in probabilistic team semantics with the Boolean negation. In particular, we study the extension of probabilistic independence logic with the Boolean negation, and a recently…

The last century saw dramatic challenges to the Laplacian predictability which had underpinned scientific research for around 300 years. Basic to this was Alan Turing's 1936 discovery (along with Alonzo Church) of the existence of…

The `catuskoti' or tetralemma in Buddhist logic is a problematic subject from the modern logical point of view. Recently a many-valued paraconsistent logic was proposed in order to formalize catuskoti adequately by G. Priest. On the other…

In a standard possibilistic logic, prioritized information are encoded by means of weighted knowledge base. This paper proposes an extension of possibilistic logic for dealing with partially ordered information. We Show that all basic…

Several different proof translations exist between classical and intuitionistic logic (negative translations), and intuitionistic and linear logic (Girard translations). Our aims in this paper are (1) to consider extensions of…

At any time, there are areas of science where we are standing at the frontier of knowledge, and can wonder whether we have reached a fundamental limit to human understanding. What is ultimately possible in physics? I will argue here that it…

The Sudoku puzzle has achieved worldwide popularity recently, and attracted great attention of the computational intelligence community. Sudoku is always considered as Satisfiability Problem or Constraint Satisfaction Problem. In this…

In this paper, I will demonstrate a new perspective on the Two Envelope Problem. I hope to show with convincing clarity how the paradox results from an inherent problem pertaining to the interpretation of Bayesian probability. Specifically,…

This paper provides a proof that Tennant's logical system entails a paradox that is called Core logic paradox, in reference to the new name given by Tennant to his intuitionistic relevant logic.

In this article, we present several apparent paradoxes of special relativity and their respective solutions. These paradoxes have appeared since the advent of relativity in 1905, and in fact they are never paradoxes. From a didactic point…

Disagreements that resist rational resolution, often termed ``deep disagreements'', have been the focus of much work in epistemology and informal logic. In this paper, I argue that they also deserve the attention of philosophers of…

Reasoning under uncertainty is a fundamental challenge in Artificial Intelligence. As with most of these challenges, there is a harsh dilemma between the expressive power of the language used, and the tractability of the computational…

Chalmer's famously identified pinpointing an explanation for our subjective experience as the "hard problem of consciousness". He argued that subjective experience constitutes a "hard problem" in the sense that its explanation will…

In this paper, we introduce a new defeasible version of propositional standpoint logic by integrating Kraus et al.'s defeasible conditionals, Britz and Varzinczak's notions of defeasible necessity and distinct possibility, along with…

We survay some nice result concerning the irrationals with a metric space point of view.Here is ofcourse nothing new may be or an expert in this field.

If no optimal propositional proof system exists, we (and independently Pudl\'ak) prove that ruling out length $t$ proofs of any unprovable sentence is hard. This mapping from unprovable to hard-to-prove sentences powerfully translates facts…