scholarly journals Truth, Demonstration and Knowledge. A Classical Solution to the Paradox of Knowability

2015 ◽  
Vol 30 (3) ◽  
pp. 365-392 ◽  
Author(s):  
Elia Zardini
Keyword(s):  
Classical Solution ◽  
Classical Logic ◽  
Knowability Principle ◽  
Paradox Of Knowability ◽  
Bhk Semantics

After introducing semantic anti-realism and the paradox of knowability, the paper offers a reconstruction of the anti-realist argument from the theory of understanding. The proposed reconstruction validates an unrestricted principle to the effect that truth requires the existence of a certain kind of “demonstration”. The paper shows that the principle fails to imply the problematic instances of the original unrestricted knowability principle but that the overall view still has unrestricted epistemic consequences. Appealing precisely to the paradox of knowability, the paper also argues, against BHK semantics, for the non-constructive character of the demonstrations envisaged by anti-realists, and contends that, in such a setting, one of the most natural arguments in favour of a revision of classical logic loses all its force.

New method for building ASP knowledge base from knowledge in classical logic

2010 ◽  
Vol 30 (11) ◽  
pp. 2932-2936
Author(s):  
Ling-zhong ZHAO ◽  
Xue-song WANG ◽  
Jun-yan QIAN ◽  
Guo-yong CAI
Keyword(s):  
Knowledge Base ◽  
Classical Logic ◽  
New Method

The Argument from Counterfactuals

2018 ◽  
Author(s):  
Alexander R. Pruss
Keyword(s):  
Natural Law ◽  
Classical Logic ◽  
Divine Command

It seems that counterfactuals and many other statements are subject to semantic underdetermination. Classical logic pushes one to an epistemicist account of this underdetermination, but epistemicism seems implausible. However epistemicism can be made plausible when conjoined with a divine institution account of meaning. This gives us some reason to accept that divine institution account, and hence some reason to think that God exists. This chapter evaluates the arguments for epistemicism and divine institution, including objections, and incorporates Plantinga’s consideration of counterfactuals when it comes to theism. In particular, an analogy is drawn with divine command and natural law theories in ethics.

The Bishop’s Church: Berkeley’s Master Argument and the Paradox of Knowability

2021 ◽  
pp. 1-16
Author(s):  
Stephen Kearns
Keyword(s):  
Master Argument ◽  
Paradox Of Knowability

Abstract We can find in the passages that set out the Master Argument a precursor to the paradox of knowability. That paradox shows that if all truths are knowable, all truths are known. Similarly, Berkeley might be read as proposing that if all sensible objects are (distinctly) conceivable, then all sensible objects are conceived.

The 10th IJCAR automated theorem proving system competition – CASC-J10

2021 ◽  
pp. 1-15
Author(s):  
Geoff Sutcliffe
Keyword(s):  
Theorem Proving ◽  
Classical Logic ◽  
Automated Theorem Proving ◽  
Fully Automatic

The CADE ATP System Competition (CASC) is the annual evaluation of fully automatic, classical logic Automated Theorem Proving (ATP) systems. CASC-J10 was the twenty-fifth competition in the CASC series. Twenty-four ATP systems and system variants competed in the various competition divisions. This paper presents an outline of the competition design, and a commentated summary of the results.

Y-Logic: A Framework for Reasoning About Chameleonic Programs with Inconsistent Completions

1990 ◽  
Vol 13 (4) ◽  
pp. 465-483
Author(s):  
V.S. Subrahmanian
Keyword(s):  
Classical Logic ◽  
Logic Program ◽  
Logic Programs ◽  
Large Subset ◽  
General Logic ◽  
Traditional Sense

Large logic programs are normally designed by teams of individuals, each of whom designs a subprogram. While each of these subprograms may have consistent completions, the logic program obtained by taking the union of these subprograms may not. However, the resulting program still serves a useful purpose, for a (possibly) very large subset of it still has a consistent completion. We argue that “small” inconsistencies may cause a logic program to have no models (in the traditional sense), even though it still serves some useful purpose. A semantics is developed in this paper for general logic programs which ascribes a very reasonable meaning to general logic programs irrespective of whether they have consistent (in the classical logic sense) completions.

scholarly journals Magnetic Global Monopoles from Torsion

2018 ◽  
Vol 182 ◽  
pp. 02110
Author(s):  
Sarben Sarkar
Keyword(s):  
Classical Solution ◽  
Magnetic Charge ◽  
New Physics ◽  
Axion Field ◽  
Global Monopoles

In the search of avatars of new physics, we present a new classical solution for electromagnetic monopoles induced by global gravitational monopoles in the presence of a four-dimensional Kalb-Ramond axion field. The torsion induces the magnetic charge of the monopole.

scholarly journals On Correspondence between Selective CPS Transformation and Selective Double Negation Translation

Mathematics ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 385
Author(s):  
Hyeonseung Im
Keyword(s):  
Programming Languages ◽  
Intuitionistic Logic ◽  
Reference Point ◽  
Classical Logic ◽  
Proof System ◽  
Double Negation

A double negation translation (DNT) embeds classical logic into intuitionistic logic. Such translations correspond to continuation passing style (CPS) transformations in programming languages via the Curry-Howard isomorphism. A selective CPS transformation uses a type and effect system to selectively translate only nontrivial expressions possibly with computational effects into CPS functions. In this paper, we review the conventional call-by-value (CBV) CPS transformation and its corresponding DNT, and provide a logical account of a CBV selective CPS transformation by defining a selective DNT via the Curry-Howard isomorphism. By using an annotated proof system derived from the corresponding type and effect system, our selective DNT translates classical proofs into equivalent intuitionistic proofs, which are smaller than those obtained by the usual DNTs. We believe that our work can serve as a reference point for further study on the Curry-Howard isomorphism between CPS transformations and DNTs.

Sign in / Sign up

Export Citation Format

Share Document