Log in

Relevant bibliographies by topics / Proof for negation / Journal articles

To see the other types of publications on this topic, follow the link: Proof for negation.

Journal articles on the topic 'Proof for negation'

Author: Grafiati

Published: 2 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Proof for negation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Trafford, James. "Co-constructive Logics for Proofs and Refutations." Studia Humana 3, no. 4 (2015): 22–40. http://dx.doi.org/10.1515/sh-2015-0004.

Full text

Abstract:

Abstract This paper considers logics which are formally dual to intuitionistic logic in order to investigate a co-constructive logic for proofs and refutations. This is philosophically motivated by a set of problems regarding the nature of constructive truth, and its relation to falsity. It is well known both that intuitionism can not deal constructively with negative information, and that defining falsity by means of intuitionistic negation leads, under widely-held assumptions, to a justification of bivalence. For example, we do not want to equate falsity with the non-existence of a proof sin

APA, Harvard, Vancouver, ISO, and other styles

2

Ahmed, Othman. "Proof of Applicatio and its Nodal Applications." Islamic Sciences Journal 11, no. 10 (2023): 252–72. http://dx.doi.org/10.25130/jis.20.11.10.11.

Full text

Abstract:

    ABSTRACT  This research labeled (the proof of application and its nodal applications) is considered one of the researches that dealt with one of the important proofs of speech scholars, which are used in response to some philosophers' concepts in the occurrence of the world, the negation of the absent, and the infinite dimensions. This research deals with the linguistic definition of the proof and the meaning of Application, it deals dealt with the idiomatic aspect of this proof, the types of proofs used by scholars of speech in establishing Islamic beli

APA, Harvard, Vancouver, ISO, and other styles

3

Raja, N. "A Negation-free Proof of Cantor's Theorem." Notre Dame Journal of Formal Logic 46, no. 2 (2005): 231–33. http://dx.doi.org/10.1305/ndjfl/1117755152.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

STÄRK, ROBERT F. "CUT-PROPERTY AND NEGATION AS FAILURE." International Journal of Foundations of Computer Science 05, no. 02 (1994): 129–64. http://dx.doi.org/10.1142/s0129054194000086.

Full text

Abstract:

What is the semantics of Negation-as-Failure in logic programming? We try to answer this question by proof-theoretic methods. A rule based sequent calculus is used in which a sequent is provable if, and only if, it is true in all three-valued models of the completion of a logic program. The main theorem is that proofs in the sequent calculus can be transformed into SLDNF-computations if, and only if, a program has the cut-property. A fragment of the sequent calculus leads to a sound and complete semantics for SLDNF-resolution with substitutions. It turns out that this version of SLDNF-resoluti

APA, Harvard, Vancouver, ISO, and other styles

5

Bílková, Marta, and Almudena Colacito. "Proof Theory for Positive Logic with Weak Negation." Studia Logica 108, no. 4 (2019): 649–86. http://dx.doi.org/10.1007/s11225-019-09869-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Kamide, Norihiro. "Concept Finding Proofs." Journal of Advanced Computational Intelligence and Intelligent Informatics 15, no. 7 (2011): 777–84. http://dx.doi.org/10.20965/jaciii.2011.p0777.

Full text

Abstract:

We propose a proof-theoretical way of obtaining detailed and precise information on conceptual hierarchies. The notion of concept finding proof, which represents a hierarchy of concepts, is introduced based on a substructural logic with mingle and strong negation. Mingle, which is a structural inference rule, is used to represent a process for finding a more general (or specific) concept than some given concepts. Strong negation, which is a negation connective, is used to represent a concept inverse operator. The problem for constructing a concept finding proof is shown to be decidable in PTIM

APA, Harvard, Vancouver, ISO, and other styles

7

Im, Hyeonseung. "On Correspondence between Selective CPS Transformation and Selective Double Negation Translation." Mathematics 9, no. 4 (2021): 385. http://dx.doi.org/10.3390/math9040385.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

8

SUCHENEK, MAREK A. "APPLICATIONS OF LYNDON HOMOMORPHISM THEOREMS TO THE THEORY OF MINIMAL MODELS." International Journal of Foundations of Computer Science 01, no. 01 (1990): 49–59. http://dx.doi.org/10.1142/s0129054190000059.

Full text

Abstract:

This paper contains, among others, a concise proof (proof 6.2) of the following fact (theorem 2.7): For every ∀∪Neg-theory Σ and every positive sentence φ, [Formula: see text] It is demonstrated in this paper (corollary 5.2) that the necessary and sufficient condition for φ, guaranteeing the truthfulness of the above equivalence for every Σ⊆∀, is that φ is equivalent to a sentence which does not contain in a scope of negation an occurrence of a relation symbol other than the equality symbol. The proofs have been constructed using classical model-theoretic tools, thus supporting the thesis that

APA, Harvard, Vancouver, ISO, and other styles

9

Dr, THIERRY TSONO MOWELLE. "Negation in Lekuwa (C27)." International Journal of Arts and Social Science 05, no. 11 (2023): 194–206. https://doi.org/10.5281/zenodo.7758697.

Full text

Abstract:

This paper investigates sentential negation in Lekuwa within the framework of Principles and Parameters developed by Noam Chomsky in the 1980’s [1, 2, 3]. Sentential negation is expressed by the negative markers te, ka, lawi, o-tano and the negative indefinite o moto. The base and surface position of te, ka and lawi is post-verbal, while that of otano and o moto is preverbal. It is demonstrated that negation in Lekuwa is a functional head which projects a NegP. Its head status is due to the fact that it selects a non-finite VP as complement, triggers the leftward movement of the object N

APA, Harvard, Vancouver, ISO, and other styles

10

Francez, Nissim. "Another plan for negation." Australasian Journal of Logic 16, no. 5 (2019): 159. http://dx.doi.org/10.26686/ajl.v16i5.5190.

Full text

Abstract:

The paper presents a plan for negation, proposing a paradigm shift from the Australian plan for negation,  leading to a family of contra-classical logics. The two main ideas are the following:   Instead of shifting points of evaluation (in a frame), shift the evaluated formula.  Introduce an incompatibility set for every atomic formula, extended to any compound formula, and impose the condition on valuations that a formula evaluates to true iff all the formulas in its incompatibility set evaluate to false. Thus, atomic sentences are not independent in their truth-values

APA, Harvard, Vancouver, ISO, and other styles

11

FUJIWARA, MAKOTO, and ULRICH KOHLENBACH. "INTERRELATION BETWEEN WEAK FRAGMENTS OF DOUBLE NEGATION SHIFT AND RELATED PRINCIPLES." Journal of Symbolic Logic 83, no. 3 (2018): 991–1012. http://dx.doi.org/10.1017/jsl.2017.63.

Full text

Abstract:

AbstractWe investigate two weak fragments of the double negation shift schema, which are motivated, respectively, from Spector’s consistency proof of ACA0 and from the negative translation of RCA0, as well as double negated variants of logical principles. Their interrelations over both intuitionistic arithmetic and analysis are completely solved.

APA, Harvard, Vancouver, ISO, and other styles

12

Holliday, Wesley H. "A Fundamental Non-Classical Logic." Logics 1, no. 1 (2023): 36–79. http://dx.doi.org/10.3390/logics1010004.

Full text

Abstract:

We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present a Fitch-style natural deduction system for the logic that contains only the introduction and elimination rules for the logical constants. From this starting point, if one adds the rule that Fitch called Reiteration, one obtains a proof system for intuitionistic logic in the given signature; if instead of adding Reiteration, one adds the rule of Reductio ad

APA, Harvard, Vancouver, ISO, and other styles

13

BARBUTI, ROBERTO, and MAURIZIO MARTELLI. "RECOGNIZING NON-FLOUNDERING LOGIC PROGRAMS AND GOALS." International Journal of Foundations of Computer Science 01, no. 02 (1990): 151–63. http://dx.doi.org/10.1142/s0129054190000126.

Full text

Abstract:

The introduction of negation in Logic Programming using the Negation as Failure Rule causes some problems regarding the completeness of the SLDNF-Resolution proof procedure. One of the causes of incompleteness arises when evaluating a non-ground negative literal. This is solved by forbidding these evaluations. Obviously, there is the possibility of having only non-ground negative literals in the goal (the floundering of the goal). There is a class of programs and goals (allowed) that has been proved to have the non-floundering property. In this paper an algorithm is proposed which recognizes a

APA, Harvard, Vancouver, ISO, and other styles

14

Pambuccian, Victor. "Negation-Free and Contradiction-Free Proof of the Steiner–Lehmus Theorem." Notre Dame Journal of Formal Logic 59, no. 1 (2018): 75–90. http://dx.doi.org/10.1215/00294527-2017-0019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Kürbis, Nils. "Proof-Theoretic Semantics, a Problem with Negation and Prospects for Modality." Journal of Philosophical Logic 44, no. 6 (2013): 713–27. http://dx.doi.org/10.1007/s10992-013-9310-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

CABALAR, PEDRO, JORGE FANDINNO, and MICHAEL FINK. "Causal Graph Justifications of Logic Programs." Theory and Practice of Logic Programming 14, no. 4-5 (2014): 603–18. http://dx.doi.org/10.1017/s1471068414000234.

Full text

Abstract:

AbstractIn this work we propose a multi-valued extension of logic programs under the stable models semantics where each true atom in a model is associated with a set of justifications. These justifications are expressed in terms of causal graphs formed by rule labels and edges that represent their application ordering. For positive programs, we show that the causal justifications obtained for a given atom have a direct correspondence to (relevant) syntactic proofs of that atom using the program rules involved in the graphs. The most interesting contribution is that this causal information is o

APA, Harvard, Vancouver, ISO, and other styles

17

Rahman, Shahid. "NO-ARGUMENTS: Denials, Refutations, Negations and the Constitution of Arguments." Characteristica Universalis Journal 1, no. 1 (2020): 135–60. https://doi.org/10.5281/zenodo.4294201.

Full text

Abstract:

L. Horn’s book <em>The Natural History of Negation</em> (Chicago UP, 1989) set both a landmark on the study of negation and a challenge. The challenge is to find some general way to understand what negation is. In fact, while for logicians and philosophers negation is a sentence building operator standardly understood as the reversal of truth and falsity for linguists negation involves a complex network of phenomena that go beyond the notion of sentence operator. Now, since the arrival and development of new notions of logic, different kinds of negation were formulated –

APA, Harvard, Vancouver, ISO, and other styles

18

Kayar, Esma. "The Principle of Excluded Middle in Kant." RIVISTA DI STORIA DELLA FILOSOFIA, no. 1 (March 2021): 124–41. http://dx.doi.org/10.3280/sf2021-001006.

Full text

Abstract:

The principle of excluded middle is more important than is commonly believed for understanding Kant's overall philosophical project. In the article, this principle is examined in the following contexts: (i) kinds of judgments, (ii) concepts of opposition, negation, and determination, and (iii) apagogic proof. It is first explained how the principle of excluded middle is employed by Kant in distinguishing between the kinds of judgment. Also called the principle of division, it is the principle of disjunctive and apodictic judgments in Kant's famous table of judgments. Next, the Author shows whi

APA, Harvard, Vancouver, ISO, and other styles

19

Schlöder, Julian J., and Peter Koepke. "The Gödel Completeness Theorem for Uncountable Languages." Formalized Mathematics 20, no. 3 (2012): 199–203. http://dx.doi.org/10.2478/v10037-012-0023-z.

Full text

Abstract:

Summary This article is the second in a series of two Mizar articles constituting a formal proof of the Gödel Completeness theorem [15] for uncountably large languages. We follow the proof given in [16]. The present article contains the techniques required to expand a theory such that the expanded theory contains witnesses and is negation faithful. Then the completeness theorem follows immediately.

APA, Harvard, Vancouver, ISO, and other styles

20

Read, Stephen. "SHEFFER’S STROKE: A STUDY IN PROOF-THEORETIC HARMONY." DANISH YEARBOOK OF PHILOSOPHY 34, no. 1 (1999): 7–23. http://dx.doi.org/10.1163/24689300_0340102.

Full text

Abstract:

In order to explicate Gentzen’s famous remark that the introduction-rules for logical constants give their meaning, the elimination-rules being simply consequences of the meaning so given, we develop natural deduction rules for Sheffer’s stroke, alternative denial. The first system turns out to lack Double Negation. Strengthening the introduction-rules by allowing the introduction of Sheffer’s stroke into a disjunctive context produces a complete system of classical logic, one which preserves the harmony between the rules which Gentzen wanted: all indirect proof reduces to direct proof.

APA, Harvard, Vancouver, ISO, and other styles

21

Damschen, Gregor. "Questioning Gödel's Ontological Proof: Is Truth Positive?" European Journal for Philosophy of Religion 3, no. 1 (2011): 161–69. http://dx.doi.org/10.24204/ejpr.v3i1.386.

Full text

Abstract:

In his “Ontological proof”, Kurt Gödel introduces the notion of a second-order value property, the positive property P. The second axiom of the proof states that for any property φ: If φ is positive, its negation is not positive, and vice versa. I put forward that this concept of positiveness leads into a paradox when we apply it to the following self-reflexive sentences: (A) The truth value of A is not positive; (B) The truth value of B is positive. Given axiom 2, sentences A and B paradoxically cannot be both true or both false, and it is also impossible that one of the sentences is true whe

APA, Harvard, Vancouver, ISO, and other styles

22

Duží, Marie. "Negation and presupposition, truth and falsity." Studies in Logic, Grammar and Rhetoric 54, no. 1 (2018): 15–46. http://dx.doi.org/10.2478/slgr-2018-0014.

Full text

Abstract:

Abstract There are many kinds of negation and denial. Perhaps the most common is the Boolean negation not that applies to propositions-in-extension, i.e. truth-values. The others are, inter alia, the property of propositions of not being true which applies to propositions; the complement function which applies to sets; privation which applies to properties; negation as failure applied in logic programming; negation as argumentation ad absurdum, and many others. The goal of this paper is neither to provide a complete list, nor to analyse all of them. Rather, I am going to deal with negation of

APA, Harvard, Vancouver, ISO, and other styles

23

Leszczyńska-Jasion, Dorota, Yaroslav Petrukhin, and Vasilyi Shangin. "The Method of Socratic Proofs Meets Correspondence Analysis." Bulletin of the Section of Logic 48, no. 2 (2019): 99–116. http://dx.doi.org/10.18778/0138-0680.48.2.02.

Full text

Abstract:

The goal of this paper is to propose correspondence analysis as a technique for generating the so-called erotetic (i.e. pertaining to the logic of questions) calculi which constitute the method of Socratic proofs by Andrzej Wiśniewski. As we explain in the paper, in order to successfully design an erotetic calculus one needs invertible sequent-calculus-style rules. For this reason, the proposed correspondence analysis resulting in invertible rules can constitute a new foundation for the method of Socratic proofs. Correspondence analysis is Kooi and Tamminga's technique for designing proo

APA, Harvard, Vancouver, ISO, and other styles

24

Avron, Arnon. "A constructive analysis of RM." Journal of Symbolic Logic 52, no. 4 (1987): 939–51. http://dx.doi.org/10.2307/2273828.

Full text

Abstract:

The system RM is the most well-understood (and to our opinion, also the most important) system among the logics developed by the Anderson and Belnap school. In this paper we investigate RM from a constructive point of view. For example, we give a new proof of the completeness of RM relative to the Sugihara matrix (first shown by Meyer), a proof in which a p.r. procedure is presented, applying which to a sentence A in RM language yields either a proof of it in RM or a refuting valuation for it in the Sugihara matrix SZ.Two topics dealt with in this work deserve a special attention.a) The admiss

APA, Harvard, Vancouver, ISO, and other styles

25

Sambin, Giovanni. "Pretopologies and completeness proofs." Journal of Symbolic Logic 60, no. 3 (1995): 861–78. http://dx.doi.org/10.2307/2275761.

Full text

Abstract:

Pretopologies were introduced in [S], and there shown to give a complete semantics for a propositional sequent calculus BL, here called basic linear logic, as well as for its extensions by structural rules, ex falso quodlibet or double negation. Immediately after Logic Colloquium '88, a conversation with Per Martin-Löf helped me to see how the pretopology semantics should be extended to predicate logic; the result now is a simple and fully constructive completeness proof for first order BL and virtually all its extensions, including the usual, or structured, intuitionistic and classical logic.

APA, Harvard, Vancouver, ISO, and other styles

26

Lahav, Ori, João Marcos, and Yoni Zohar. "Sequent Systems for Negative Modalities." Logica Universalis 11, no. 3 (2017): 345–82. http://dx.doi.org/10.1007/s11787-017-0175-2.

Full text

Abstract:

Abstract Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate semantics and proof systems, whose philosophical interpretations and computational properties are found wanting. In this paper we investigate congruential non-classical negations that live inside very natural systems of normal modal logics over complete distributive lattices; these logics are further enriched by adjustment connectives that may be u

APA, Harvard, Vancouver, ISO, and other styles

27

Mangenakis, Panagiotis Georgiou, and Basil Papadopoulos. "Innovative Methods of Constructing Strict and Strong Fuzzy Negations, Fuzzy Implications and New Classes of Copulas." Mathematics 12, no. 14 (2024): 2254. http://dx.doi.org/10.3390/math12142254.

Full text

Abstract:

This paper presents new classes of strong fuzzy negations, fuzzy implications and Copulas. It begins by presenting two theorems with function classes involving the construction of strong fuzzy negations. These classes are based on a well-known equilibrium point theorem. After that, a construction of fuzzy implication is presented, which is not based on any negation. Finally, moving on to the area concerning copulas, we present proof about the third property of copulas. To conclude, we will present two original constructions of copulas. All the above constructions are motivated by a specific fo

APA, Harvard, Vancouver, ISO, and other styles

28

ADAMS, ROBIN, and ZHAOHUI LUO. "A pluralist approach to the formalisation of mathematics." Mathematical Structures in Computer Science 21, no. 4 (2011): 913–42. http://dx.doi.org/10.1017/s0960129511000156.

Full text

Abstract:

We present a programme of research for pluralist formalisations, that is, formalisations that involve proving results in more than one foundation.A foundation consists of two parts: a logical part, which provides a notion of inference, and a non-logical part, which provides the entities to be reasoned about. An LTT is a formal system composed of two such separate parts. We show how LTTs may be used as the basis for a pluralist formalisation.We show how different foundations may be formalised as LTTs, and also describe a new method for proof reuse. If we know that a translation Φ exists between

APA, Harvard, Vancouver, ISO, and other styles

29

Eades III, Harley, and Valeria de Paiva. "Multiple conclusion linear logic: cut elimination and more." Journal of Logic and Computation 30, no. 1 (2020): 157–74. http://dx.doi.org/10.1093/logcom/exaa006.

Full text

Abstract:

Abstract Full intuitionistic linear logic (FILL) was first introduced by Hyland and de Paiva, and went against current beliefs that it was not possible to incorporate all of the linear connectives, e.g. tensor, par and implication, into an intuitionistic linear logic. Bierman showed that their formalization of FILL did not enjoy cut elimination as such, but Bellin proposed a small change to the definition of FILL regaining cut elimination and using proof nets. In this note we adopt Bellin’s proposed change and give a direct proof of cut elimination for the sequent calculus. Then we show that a

APA, Harvard, Vancouver, ISO, and other styles

30

Ascari, Flavio, Roberto Bruni, Roberta Gori, and Francesco Logozzo. "Revealing Sources of (Memory) Errors via Backward Analysis." Proceedings of the ACM on Programming Languages 9, OOPSLA1 (2025): 1321–48. https://doi.org/10.1145/3720486.

Full text

Abstract:

Sound over-approximation methods are effective for proving the absence of errors, but inevitably produce false alarms that can hamper programmers. In contrast, under-approximation methods focus on bug detection and are free from false alarms. In this work, we present two novel proof systems designed to locate the source of errors via backward under-approximation, namely Sufficient Incorrectness Logic (SIL) and its specialization for handling memory errors, called Separation SIL. The SIL proof system is minimal, sound and complete for Lisbon triples, enabling a detailed comparison of triple-bas

APA, Harvard, Vancouver, ISO, and other styles

31

Dyckhoff, Roy. "Contraction-free sequent calculi for intuitionistic logic." Journal of Symbolic Logic 57, no. 3 (1992): 795–807. http://dx.doi.org/10.2307/2275431.

Full text

Abstract:

Gentzen's sequent calculus LJ, and its variants such as G3 [21], are (as is well known) convenient as a basis for automating proof search for IPC (intuitionistic propositional calculus). But a problem arises: that of detecting loops, arising from the use (in reverse) of the rule ⊃⇒ for implication introduction on the left. We describe below an equivalent calculus, yet another variant on these systems, where the problem no longer arises: this gives a simple but effective decision procedure for IPC.The underlying method can be traced back forty years to Vorob′ev [33], [34]. It has been rediscove

APA, Harvard, Vancouver, ISO, and other styles

32

Dierig, Simon. "Moore’s Proof, Perception, and Scepticism (Moores Beweis, Wahrnehmung und Skeptizismus)." Grazer Philosophische Studien 94, no. 4 (2017): 552–76. http://dx.doi.org/10.1163/18756735-000016.

Full text

Abstract:

Two major arguments have been advanced for the claim that there is a transmission failure in G.E. Moore’s famous proof of an external world. The first argument, due to Crispin Wright, is based on an epistemological doctrine now known as ‘conservatism’. Proponents of the second argument, like Nicholas Silins, invoke probabilistic considerations, most important among them Bayes’ theorem. The aim of this essay is to defend Moore’s proof against these two arguments. It is shown, first, that Wright’s argument founders because one of its premises, viz., conservatism, invites scepticism and must ther

APA, Harvard, Vancouver, ISO, and other styles

33

Seldin, Jonathan P. "On the role of implication in formal logic." Journal of Symbolic Logic 65, no. 3 (2000): 1076–114. http://dx.doi.org/10.2307/2586689.

Full text

Abstract:

AbstractEvidence is given that implication (and its special case, negation) carry the logical strength of a system of formal logic. This is done by proving normalization and cut elimination for a system based on combinatory logic or λ-calculus with logical constants for and, or, all, and exists, but with none for either implication or negation. The proof is strictly finitary, showing that this system is very weak. The results can be extended to a “classical” version of the system. They can also be extended to a system with a restricted set of rules for implication: the result is a system of in

APA, Harvard, Vancouver, ISO, and other styles

34

FÜHRMANN, CARSTEN, and DAVID PYM. "On categorical models of classical logic and the Geometry of Interaction." Mathematical Structures in Computer Science 17, no. 5 (2007): 957–1027. http://dx.doi.org/10.1017/s0960129507006287.

Full text

Abstract:

It is well known that weakening and contraction cause naive categorical models of the classical sequent calculus to collapse to Boolean lattices. In previous work, summarised briefly herein, we have provided a class of models calledclassical categoriesthat is sound and complete and avoids this collapse by interpreting cut reduction by a poset enrichment. Examples of classical categories include boolean lattices and the category of sets and relations, where both conjunction and disjunction are modelled by the set-theoretic product. In this article, which is self-contained, we present an improve

APA, Harvard, Vancouver, ISO, and other styles

35

Bibi, Sadat Razi Bahabadi, shayanfar shahnaz, and Motamad Langrody Fereshteh. "Philosophical Implications of the Words of Imam Reza (P.B.U.H.) in the Issue of Inherent Monotheism Shahnaz Shayanfer." Journal of Razavi Culture 6, no. 24 (2021): 105–26. https://doi.org/10.5281/zenodo.5514054.

Full text

Abstract:

''Monotheism" is the most basic belief of Islam and other religious teachings and human values education emanates from it. Inherent Monotheism is the most important kind of Monotheism and the base of all Monotheism levels. Imam Reza (A.S.), like other Imams, has paid special attention to this vital issue. The two main questions of this article are: What is the stance of Imam Reza (A.S.) on Inherent Monotheism? And how can one, based on a philosophical look, reveal the hidden implications of the monotheistic viewpoint of Imam Reza (A.S.)? The results are as follows: In the words of

APA, Harvard, Vancouver, ISO, and other styles

36

RAHLI, VINCENT, and MARK BICKFORD. "Validating Brouwer's continuity principle for numbers using named exceptions." Mathematical Structures in Computer Science 28, no. 6 (2017): 942–90. http://dx.doi.org/10.1017/s0960129517000172.

Full text

Abstract:

This paper extends the Nuprl proof assistant (a system representative of the class of extensional type theories with dependent types) withnamed exceptionsandhandlers, as well as a nominalfreshoperator. Using these new features, we prove a version of Brouwer's continuity principle for numbers. We also provide a simpler proof of a weaker version of this principle that only uses diverging terms. We prove these two principles in Nuprl's metatheory using our formalization of Nuprl in Coq and reflect these metatheoretical results in the Nuprl theory as derivation rules. We also show that these addit

APA, Harvard, Vancouver, ISO, and other styles

37

CABALAR, PEDRO, and JORGE FANDINNO. "Enablers and inhibitors in causal justifications of logic programs." Theory and Practice of Logic Programming 17, no. 1 (2016): 49–74. http://dx.doi.org/10.1017/s1471068416000107.

Full text

Abstract:

AbstractIn this paper, we propose an extension of logic programming where each default literal derived from the well-founded model is associated to a justification represented as an algebraic expression. This expression contains both causal explanations (in the form of proof graphs built with rule labels) and terms under the scope of negation that stand for conditions that enable or disable the application of causal rules. Using some examples, we discuss how these new conditions, we respectively callenablersandinhibitors, are intimately related to default negation and have an essentially diffe

APA, Harvard, Vancouver, ISO, and other styles

38

Niki, Satoru. "Investigations into intuitionistic and other negations." Bulletin of Symbolic Logic 28, no. 4 (2022): 532. http://dx.doi.org/10.1017/bsl.2022.29.

Full text

Abstract:

AbstractIntuitionistic logic formalises the foundational ideas of L.E.J. Brouwer’s mathematical programme of intuitionism. It is one of the earliest non-classical logics, and the difference between classical and intuitionistic logic may be interpreted to lie in the law of the excluded middle, which asserts that either a proposition is true or its negation is true. This principle is deemed unacceptable from the constructive point of view, in whose understanding the law means that there is an effective procedure to determine the truth of all propositions. This understanding of the distinction be

APA, Harvard, Vancouver, ISO, and other styles

39

SADRZADEH, MEHRNOOSH, and ROY DYCKHOFF. "POSITIVE LOGIC WITH ADJOINT MODALITIES: PROOF THEORY, SEMANTICS, AND REASONING ABOUT INFORMATION." Review of Symbolic Logic 3, no. 3 (2010): 351–73. http://dx.doi.org/10.1017/s1755020310000134.

Full text

Abstract:

We consider a simple modal logic whose nonmodal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of axioms corresponding to the characteristic axioms of (e.g.) T, S4, and S5, such logics are useful, as shown in previous work by Baltag, Coecke, and the first author, for encoding and reasoning about information and misinformation in multiagent systems. For the propositional-only fragment of such a dynamic epistemic logic, we present an algebraic semantics, usi

APA, Harvard, Vancouver, ISO, and other styles

40

Ciesielski, Krzysztof. "Martin's axiom and a regular topological space with uncountable net weight whose countable product is hereditarily separable and hereditarily Lindelöf." Journal of Symbolic Logic 52, no. 2 (1987): 396–99. http://dx.doi.org/10.2307/2274389.

Full text

Abstract:

In [1, p. 51] A. V. Arhangel'skiĭ, in connection with the problems of L-spaces and S-spaces, examined further the notions of hereditary separability and hereditary Lindelöfness. In particular he considered the following property P: “Every regular topological space has a countable net weight provided its countable product is hereditarily Lindelöf and hereditarily separable.” He noticed that the continuum hypothesis implies negation of the property P and posed a question: “Do Martin's Axiom and the negation of the continuum hypothesis imply P?” The purpose of this paper is to give a negative ans

APA, Harvard, Vancouver, ISO, and other styles

41

Freiling, Chris. "Axioms of symmetry: Throwing darts at the real number line." Journal of Symbolic Logic 51, no. 1 (1986): 190–200. http://dx.doi.org/10.2307/2273955.

Full text

Abstract:

AbstractWe will give a simple philosophical “proof” of the negation of Cantor's continuum hypothesis (CH). (A formal proof for or against CH from the axioms of ZFC is impossible; see Cohen [1].) We will assume the axioms of ZFC together with intuitively clear axioms which are based on some intuition of Stuart Davidson and an old theorem of Sierpiński and are justified by the symmetry in a thought experiment throwing darts at the real number line. We will in fact show why there must be an infinity of cardinalities between the integers and the reals. We will also show why Martin's Axiom must be

APA, Harvard, Vancouver, ISO, and other styles

42

Al-Aff, Bassam. "Its Judgment and Its Applications "A Fiqh (The Evidence of Negation Study)." Journal of Umm Al-Qura University for Sharia'h Sciences and Islamic Studies, no. 90 (September 1, 2022): 148–64. http://dx.doi.org/10.54940/si78812401.

Full text

Abstract:

This research is entitled: (The Evidence of Negation، Its Judgment and Its Applications "A Fiqh Study") it deals with an in-depth study of an issue related to the jurisprudence of the judiciary، there was a dispute about it and details: Is the evidence of the denial accepted or not? What are the cases in which the evidence of the denial is accepted? And the cases in which it is not accepted، and then extracting the general officer for that، by talking about its nature in Sharia and law، and clarifying its origin, types and applications، according to the descriptive، inductive, and analytical a

APA, Harvard, Vancouver, ISO, and other styles

43

De Colnet, Alexis, and Stefan Mengel. "Characterizing Tseitin-Formulas with Short Regular Resolution Refutations." Journal of Artificial Intelligence Research 76 (January 9, 2023): 265–86. http://dx.doi.org/10.1613/jair.1.13521.

Full text

Abstract:

Tseitin-formulas are systems of parity constraints whose structure is described by a graph. These formulas have been studied extensively in proof complexity as hard instances in many proof systems. In this paper, we prove that a class of unsatisfiable Tseitin-formulas of bounded degree has regular resolution refutations of polynomial length if and only if the treewidth of all underlying graphs G for that class is in O(log |V (G)|). It follows that unsatisfiable Tseitin-formulas with polynomial length of regular resolution refutations are completely determined by the treewidth of the underlying

APA, Harvard, Vancouver, ISO, and other styles

44

Giero, Mariusz. "Weak Completeness Theorem for Propositional Linear Time Temporal Logic." Formalized Mathematics 20, no. 3 (2012): 227–34. http://dx.doi.org/10.2478/v10037-012-0027-8.

Full text

Abstract:

Summary We prove weak (finite set of premises) completeness theorem for extended propositional linear time temporal logic with irreflexive version of until-operator. We base it on the proof of completeness for basic propositional linear time temporal logic given in [20] which roughly follows the idea of the Henkin-Hasenjaeger method for classical logic. We show that a temporal model exists for every formula which negation is not derivable (Satisfiability Theorem). The contrapositive of that theorem leads to derivability of every valid formula. We build a tree of consistent and complete PNPs wh

APA, Harvard, Vancouver, ISO, and other styles

45

Guilloud, Simon, and Viktor Kunčak. "Orthologic with Axioms." Proceedings of the ACM on Programming Languages 8, POPL (2024): 1150–78. http://dx.doi.org/10.1145/3632881.

Full text

Abstract:

We study the proof theory and algorithms for orthologic, a logical system based on ortholattices, which have shown practical relevance in simplification and normalization of verification conditions. Ortholattices weaken Boolean algebras while having polynomial-time equivalence checking that is sound with respect to Boolean algebra semantics. We generalize ortholattice reasoning and obtain an algorithm for proving a larger class of classically valid formulas. As the key result, we analyze a proof system for orthologic augmented with axioms. An important feature of the system is that it limits t

APA, Harvard, Vancouver, ISO, and other styles

46

Yang, Eunsuk. "Fixpointed Idempotent Uninorm (Based) Logics." Mathematics 7, no. 1 (2019): 107. http://dx.doi.org/10.3390/math7010107.

Full text

Abstract:

Idempotent uninorms are simply defined by fixpointed negations. These uninorms, called here fixpointed idempotent uninorms, have been extensively studied because of their simplicity, whereas logics characterizing such uninorms have not. Recently, fixpointed uninorm mingle logic (fUML) was introduced, and its standard completeness, i.e., completeness on real unit interval [ 0 , 1 ] , was proved by Baldi and Ciabattoni. However, their proof is not algebraic and does not shed any light on the algebraic feature by which an idempotent uninorm is characterized, using operations defined by a fixpoint

APA, Harvard, Vancouver, ISO, and other styles

47

Stafford, Will. "Something Valid This Way Comes: A Study of Neologicism and Proof-Theoretic Validity." Bulletin of Symbolic Logic 28, no. 4 (2022): 530–31. http://dx.doi.org/10.1017/bsl.2022.16.

Full text

Abstract:

AbstractThe interplay of philosophical ambitions and technical reality have given birth to rich and interesting approaches to explain the oft-claimed special character of mathematical and logical knowledge. Two projects stand out both for their audacity and their innovativeness. These are logicism and proof-theoretic semantics. This dissertation contains three chapters exploring the limits of these two projects. In both cases I find the formal results offer a mixed blessing to the philosophical projects.Chapter 1. Is a logicist bound to the claim that as a matter of analytic truth there is an

APA, Harvard, Vancouver, ISO, and other styles

48

ESCARDÓ, MARTÍN. "Constructive decidability of classical continuity." Mathematical Structures in Computer Science 25, no. 7 (2014): 1578–89. http://dx.doi.org/10.1017/s096012951300042x.

Full text

Abstract:

We show that the following instance of the principle of excluded middle holds: any function on the one-point compactification of the natural numbers with values on the natural numbers is either classically continuous or classically discontinuous. The proof does not require choice and can be understood in any of the usual varieties of constructive mathematics. Classical (dis)continuity is a weakening of the notion of (dis)continuity, where the existential quantifiers are replaced by negated universal quantifiers. We also show that the classical continuity of all functions is equivalent to the n

APA, Harvard, Vancouver, ISO, and other styles

49

PRATT-HARTMANN, IAN, and LAWRENCE S. MOSS. "LOGICS FOR THE RELATIONAL SYLLOGISTIC." Review of Symbolic Logic 2, no. 4 (2009): 647–83. http://dx.doi.org/10.1017/s1755020309990086.

Full text

Abstract:

The Aristotelian syllogistic cannot account for the validity of certain inferences involving relational facts. In this paper, we investigate the prospects for providing a relational syllogistic. We identify several fragments based on (a) whether negation is permitted on all nouns, including those in the subject of a sentence; and (b) whether the subject noun phrase may contain a relative clause. The logics we present are extensions of the classical syllogistic, and we pay special attention to the question of whether reductio ad absurdum is needed. Thus our main goal is to derive results on the

APA, Harvard, Vancouver, ISO, and other styles

50

KANOVICH, MAX. "The undecidability theorem for the Horn-like fragment of linear logic (Revisited)." Mathematical Structures in Computer Science 26, no. 5 (2016): 719–44. http://dx.doi.org/10.1017/s0960129516000049.

Full text

Abstract:

There has been an increased interest in the decision problems for linear logic and its fragments. Here, we give a fully self-contained, easy-to-follow, but fully detailed, direct and constructive proof of the undecidability of a very simple Horn-like fragment of linear logic, which is accessible to a wide range of people. Namely, we show that there is a direct correspondence between terminated computations of a Minsky machine M and cut-free linear logic derivations for a Horn-like sequent of the form \begin{equation*} \bang{\Phi_M},\ l_1 \vdash l_0, \end{equation*} where ΦM consists only of Ho

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!