Log in

Relevant bibliographies by topics / Logic / Journal articles

To see the other types of publications on this topic, follow the link: Logic.

Journal articles on the topic 'Logic'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 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 'Logic.'

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

Holba, Jiří. "Buddhismus a aristotelská logika." FILOSOFIE DNES 3, no. 1 (2011): 27–36. http://dx.doi.org/10.26806/fd.v3i1.60.

Full text

Abstract:

Abstrakt/Abstract Článek pojednává o buddhistické logice a jejím vztahu k logice aristotelské, zejména k principu sporu a principu vyloučeného třetího. Dotkne se také dialetheismu a parakonzistentních logik, které se v souvislosti s interpretacemi buddhismu objevují. The article deals with the Buddhist logic and its relation to Aristotle’s logic, in particular, to the principle of non-contradiction and the principle of exluded middle. It also tackles the topic of dialetheism and paraconsistent logics, which are sometimes mentioned in connection with the interpretations of Buddhism.

APA, Harvard, Vancouver, ISO, and other styles

2

Holba, Jiří. "Buddhismus a aristotelská logika." FILOSOFIE DNES 3, no. 1 (2011): 27–36. http://dx.doi.org/10.26806/fd.v3i1.325.

Full text

Abstract:

Abstrakt/Abstract Článek pojednává o buddhistické logice a jejím vztahu k logice aristotelské, zejména k principu sporu a principu vyloučeného třetího. Dotkne se také dialetheismu a parakonzistentních logik, které se v souvislosti s interpretacemi buddhismu objevují. The article deals with the Buddhist logic and its relation to Aristotle’s logic, in particular, to the principle of non-contradiction and the principle of exluded middle. It also tackles the topic of dialetheism and paraconsistent logics, which are sometimes mentioned in connection with the interpretations of Buddhism.

APA, Harvard, Vancouver, ISO, and other styles

3

Lewitzka, Steffen. "Abstract Logics, Logic Maps, and Logic Homomorphisms." Logica Universalis 1, no. 2 (2007): 243–76. http://dx.doi.org/10.1007/s11787-007-0013-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Oliveira, Kleidson Êglicio Carvalho da Silva. "Paraconsistent Logic Programming in Three and Four-Valued Logics." Bulletin of Symbolic Logic 28, no. 2 (2022): 260. http://dx.doi.org/10.1017/bsl.2021.34.

Full text

Abstract:

AbstractFrom the interaction among areas such as Computer Science, Formal Logic, and Automated Deduction arises an important new subject called Logic Programming. This has been used continuously in the theoretical study and practical applications in various fields of Artificial Intelligence. After the emergence of a wide variety of non-classical logics and the understanding of the limitations presented by first-order classical logic, it became necessary to consider logic programming based on other types of reasoning in addition to classical reasoning. A type of reasoning that has been well stu

APA, Harvard, Vancouver, ISO, and other styles

5

Tulenheimo, Tero. "Three Nordic Neo-Aristotelians and the First Doorkeeper of Logic." Studia Neoaristotelica 19, no. 1 (2022): 3–106. http://dx.doi.org/10.5840/studneoar20221911.

Full text

Abstract:

I discuss the views on logic held by three early Nordic neo-Aristotelians — the Swedes Johannes Canuti Lenaeus (1573–1669) and Johannes Rudbeckius (1581–1646), and the Dane Caspar Bartholin (1585–1629). They all studied in Wittenberg (enrolled respectively in 1597, 1601, and 1604) and were exponents of protestant (Lutheran) scholasticism. The works I utilize are Janitores logici bini (1607) and Enchiridion logicum (1608) by Bartholin; Logica (1625) and Controversiae logices (1629) by Rudbeckius; and Logica peripatetica (1633) by Lenaeus. Rudbeckius’s and Lenaeus’s books were published much lat

APA, Harvard, Vancouver, ISO, and other styles

6

Feferman, Solomon. "Logic, Logics, and Logicism." Notre Dame Journal of Formal Logic 40, no. 1 (1999): 31–54. http://dx.doi.org/10.1305/ndjfl/1039096304.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Golan, Rea, and Ulf Hlobil. "Minimally Nonstandard K3 and FDE." Australasian Journal of Logic 19, no. 5 (2022): 182–213. http://dx.doi.org/10.26686/ajl.v19i5.7540.

Full text

Abstract:

Graham Priest has formulated the minimally inconsistent logic of paradox (MiLP), which is paraconsistent like Priest’s logic of paradox (LP), while staying closer to classical logic. We present logics that stand to (the propositional fragments of) strong Kleene logic (K3) and the logic of first-degree entailment (FDE) as MiLP stands to LP. That is, our logics share the paracomplete and the paraconsistent-cum-paracomplete nature of K3 and FDE, respectively, while keeping these features to a minimum in order to stay closer to classical logic. We give semantic and sequent-calculus formulations of

APA, Harvard, Vancouver, ISO, and other styles

8

Mott, Peter. "Default non-monotonic logic." Knowledge Engineering Review 3, no. 4 (1988): 265–84. http://dx.doi.org/10.1017/s0269888900004586.

Full text

Abstract:

AbstractThis paper is a review of certain non-monotonic logics, which I call default non-monotonic logics. These are logics which exploit failure to prove. How each logic uses this basic idea is explained, and examples given. The emphasis is on leading ideas explained through examples: technical detail is avoided. Four non-monotonic logics are discussed: Reiter's default logic, McCarthy's circumscription, McDermott's modal non-monotonic logic, and Clarks's completed database. The first two are treated in some detail. The recent Hanks-McDermott criticism of non-monotonic logic is discussed, and

APA, Harvard, Vancouver, ISO, and other styles

9

Mruczek-Nasieniewska, Krystyna, and Marek Nasieniewski. "A Kotas-Style Characterisation of Minimal Discussive Logic." Axioms 8, no. 4 (2019): 108. http://dx.doi.org/10.3390/axioms8040108.

Full text

Abstract:

In this paper, we discuss a version of discussive logic determined by a certain variant of Jaśkowski’s original model of discussion. The obtained system can be treated as the minimal discussive logic. It is determined by frames with serial accessibility relation. As the smallest one, this logic can be treated as a basis which could be extended to richer discussive logics that are obtained by varying accessibility relation and resulting in a lattice of discussive logics. One has to remember that while formulating discussive logics there is no one-to-one determination of discussive logics by mod

APA, Harvard, Vancouver, ISO, and other styles

10

Francez, Nissim. "Bilateral Connexive Logic." Logics 1, no. 3 (2023): 157–62. http://dx.doi.org/10.3390/logics1030008.

Full text

Abstract:

This paper proposes a bilateral analysis of connexivity, presenting a bilateral natural deduction system for a weak connexive logic. The proposed logic deviates from other connexive logics and other bilateral logics in the following respects: (1) The logic induces a difference in meaning between inner and outer occurrences of negation in the connexive axioms. (2) The logic allows incoherence—assertion and denial of the same formula—while still being non-trivial.

APA, Harvard, Vancouver, ISO, and other styles

11

Kent, Pamela, and Dennis van Liempd. "Linking Corporate Institutional Logics and Moral Reasoning – Evidence from Large Danish Audit Firms." management revue 32, no. 1 (2021): 53–83. http://dx.doi.org/10.5771/0935-9915-2021-1-53.

Full text

Abstract:

This paper examines whether organizational levels of owner/partner, CPA manager, supervisor and other audit staff are associated with institutional logics of auditors in large Danish audit firms. Our findings identify the presence of the professional logic and commercial logic with the professional logic being two explicit logics of a fiduciary and a technical-expertise logic. The organizational levels of CPA manager, supervisor and other staff are significant in explaining the presence of the technical-expertise logic, but not the fiduciary logic. Higher moral reasoning of auditors and being

APA, Harvard, Vancouver, ISO, and other styles

12

Kent, Pamela, and Dennis van Liempd. "Linking Corporate Institutional Logics and Moral Reasoning – Evidence from Large Danish Audit Firms." management revue 32, no. 1 (2021): 54–84. http://dx.doi.org/10.5771/0935-9915-2021-1-54.

Full text

Abstract:

This paper examines whether organizational levels of owner/partner, CPA manager, supervisor and other audit staff are associated with institutional logics of auditors in large Danish audit firms. Our findings identify the presence of the professional logic and commercial logic with the professional logic being two explicit logics of a fiduciary and a technical-expertise logic. The organizational levels of CPA manager, supervisor and other staff are significant in explaining the presence of the technical-expertise logic, but not the fiduciary logic. Higher moral reasoning of auditors and being

APA, Harvard, Vancouver, ISO, and other styles

13

MA, MINGHUI, and HANS VAN DITMARSCH. "DYNAMIC GRADED EPISTEMIC LOGIC." Review of Symbolic Logic 12, no. 4 (2019): 663–84. http://dx.doi.org/10.1017/s1755020319000285.

Full text

Abstract:

AbstractGraded epistemic logic is a logic for reasoning about uncertainties. Graded epistemic logic is interpreted on graded models. These models are generalizations of Kripke models. We obtain completeness of some graded epistemic logics. We further develop dynamic extensions of graded epistemic logics, along the framework of dynamic epistemic logic. We give an extension with public announcements, i.e., public events, and an extension with graded event models, a generalization also including nonpublic events. We present complete axiomatizations for both logics.

APA, Harvard, Vancouver, ISO, and other styles

14

Tiaglo, O. V. "Is There a Specifically Juristic Logic?" Forum prava 65, Suppl. (2020): t10—t15. https://doi.org/10.5281/zenodo.4082815.

Full text

Abstract:

Two main approaches to understand juristic logic are analyzed. In accordance with the first approach, called trivial, juristic logic is the application of general, or formal, logic in field of law (I. Tammelo, H. Kelsen, etc.). However, some remarks by Kant, Heidegger, or Toulmin help to derive that along with general logic special, or material, logics exist. These material logics are determined not only by frames of their fields of application but also by essential contents of these diverse fields, i.e., they are content-of-field-dependent. Juristic logic is one of the material logics: this a

APA, Harvard, Vancouver, ISO, and other styles

15

Ishihara, Hajime. "A Canonical Model Construction for Substructural Logics." JUCS - Journal of Universal Computer Science 6, no. (1) (2000): 155–68. https://doi.org/10.3217/jucs-006-01-0155.

Full text

Abstract:

In this paper, we introduce a class of substructural logics, called normal substructural logics, which includes not only relevant logic, BCK logic, linear logic and the Lambek calculus but also weak logics with strict implication, and de ne Kripke- style semantics (Kripke frames and models) for normal substructural logics. Then we show a correspondence between axioms and properties on frames, and give a canonical construction of Kripke models for normal substructural logics. 1 C.S.Calude and G.Stefanescu (eds.). Automata, Logic, and Computability. Special issue dedicated to Professor Sergiu Ru

APA, Harvard, Vancouver, ISO, and other styles

16

BLUTE, R., J. R. B. COCKETT, and R. A. G. SEELY. "The logic of linear functors." Mathematical Structures in Computer Science 12, no. 4 (2002): 513–39. http://dx.doi.org/10.1017/s0960129502003717.

Full text

Abstract:

This paper describes a family of logics whose categorical semantics is based on functors with structure rather than on categories with structure. This allows the consideration of logics that contain possibly distinct logical subsystems whose interactions are mediated by functorial mappings. For example, within one unified framework, we shall be able to handle logics as diverse as modal logic, ordinary linear logic, and the ‘noncommutative logic’ of Abrusci and Ruet, a variant of linear logic that has both commutative and noncommutative connectives.Although this paper will not consider in depth

APA, Harvard, Vancouver, ISO, and other styles

17

Cloutier, Charlotte, and Ann Langley. "The Logic of Institutional Logics." Journal of Management Inquiry 22, no. 4 (2013): 360–80. http://dx.doi.org/10.1177/1056492612469057.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Firdaus, Qusthan A. H. "What is This Thing Called Adat Logic?" Jurnal Filsafat 32, no. 1 (2022): 58. http://dx.doi.org/10.22146/jf.70202.

Full text

Abstract:

The notion of adat (or custom) law does not encourage people in philosophy to reveal its logic. This article aims to investigate the possibility of adat logic, its variety, and a possible common ground or thesis among its own kinds. In general, the adat logic means the true contradiction between the rigidity and the reflexibility of custom. In other words, it resembles the idea of dialetheia in modern logic, but it does not mean that the adat logic is a subdivision of the former. To seek a thesis of adat logic is to discuss the Javanese and Minangkabaunese adat logics, and I transform both log

APA, Harvard, Vancouver, ISO, and other styles

19

PUNČOCHÁŘ, VÍT. "SUBSTRUCTURAL INQUISITIVE LOGICS." Review of Symbolic Logic 12, no. 2 (2019): 296–330. http://dx.doi.org/10.1017/s1755020319000017.

Full text

Abstract:

AbstractThis paper shows that any propositional logic that extends a basic substructural logic BSL (a weak, nondistributive, nonassociative, and noncommutative version of Full Lambek logic with a paraconsistent negation) can be enriched with questions in the style of inquisitive semantics and logic. We introduce a relational semantic framework for substructural logics that enables us to define the notion of an inquisitive extension of λ, denoted as ${\lambda ^?}$, for any logic λ that is at least as strong as BSL. A general theory of these “inquisitive extensions” is worked out. In particular,

APA, Harvard, Vancouver, ISO, and other styles

20

Kreitz, Christoph, and Jens Otten. "Connection-Based Theorem Proving in Classical and Non-Classical Logics." JUCS - Journal of Universal Computer Science 5, no. (3) (1999): 88–112. https://doi.org/10.3217/jucs-005-03-0088.

Full text

Abstract:

We present a uniform procedure for proof search in classical logic, intuitionistic logic, various modal logics, and fragments of linear logic. It is based on matrix characterizations of validity in these logics and extends Bibel's connection method, originally developed for classical logic, accordingly. Besides combining a variety of different logics it can also be used to guide the development of proofs in interactive proof assistants and shows how to integrate automated and interactive theorem proving.

APA, Harvard, Vancouver, ISO, and other styles

21

Kuznetsov, Stepan. "Action Logic is Undecidable." ACM Transactions on Computational Logic 22, no. 2 (2021): 1–26. http://dx.doi.org/10.1145/3445810.

Full text

Abstract:

Action logic is the algebraic logic (inequational theory) of residuated Kleene lattices. One of the operations of this logic is the Kleene star, which is axiomatized by an induction scheme. For a stronger system that uses an -rule instead (infinitary action logic), Buszkowski and Palka (2007) proved -completeness (thus, undecidability). Decidability of action logic itself was an open question, raised by Kozen in 1994. In this article, we show that it is undecidable, more precisely, -complete. We also prove the same undecidability results for all recursively enumerable logics between action log

APA, Harvard, Vancouver, ISO, and other styles

22

Boolos, George. "Logic, Logic, and Logic." History and Philosophy of Logic 21, no. 3 (2000): 223–29. http://dx.doi.org/10.1080/01445340051095856.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

HUET, GÉRARD. "Special issue on ‘Logical frameworks and metalanguages’." Journal of Functional Programming 13, no. 2 (2003): 257–60. http://dx.doi.org/10.1017/s0956796802004549.

Full text

Abstract:

There is both a great unity and a great diversity in presentations of logic. The diversity is staggering indeed – propositional logic, first-order logic, higher-order logic belong to one classification; linear logic, intuitionistic logic, classical logic, modal and temporal logics belong to another one. Logical deduction may be presented as a Hilbert style of combinators, as a natural deduction system, as sequent calculus, as proof nets of one variety or other, etc. Logic, originally a field of philosophy, turned into algebra with Boole, and more generally into meta-mathematics with Frege and

APA, Harvard, Vancouver, ISO, and other styles

24

Majkic, Zoran. "Paraconsistent da Costa Weakening of Intuitionistic Negation: What does it mean?" International Journal of Pure Mathematics 9 (March 16, 2022): 35–48. http://dx.doi.org/10.46300/91019.2022.9.9.

Full text

Abstract:

In this paper we consider the systems of weakening of intuitionistic negation logic mZ, introduced in [1], [2], which are developed in the spirit of da Costa's approach. We take a particular attention on the philosophical considerations of the paraconsistent mZ logic w.r.t. the constructive semantics of the intuitionistic logic, and we show that mZ is a subintuitionistic logic. Hence, we present the relationship between intuitionistic and paraconsistent subintuitionistic negation used in mZ. Then we present a significant number of examples for this subintuitionistic and paraconsistent mZ logic

APA, Harvard, Vancouver, ISO, and other styles

25

Koellner, Peter. "Strong Logics of First and Second Order." Bulletin of Symbolic Logic 16, no. 1 (2010): 1–36. http://dx.doi.org/10.2178/bsl/1264433796.

Full text

Abstract:

AbstractIn this paper we investigate strong logics of first and second order that have certain absoluteness properties. We begin with an investigation of first order logic and the strong logics ω-logic and β-logic, isolating two facets of absoluteness, namely, generic invariance and faithfulness. It turns out that absoluteness is relative in the sense that stronger background assumptions secure greater degrees of absoluteness. Our aim is to investigate the hierarchies of strong logics of first and second order that are generically invariant and faithful against the backdrop of the strongest la

APA, Harvard, Vancouver, ISO, and other styles

26

Schurz, Gerhard. "Why classical logic is privileged: justification of logics based on translatability." Synthese 199, no. 5-6 (2021): 13067–94. http://dx.doi.org/10.1007/s11229-021-03367-2.

Full text

Abstract:

AbstractIn Sect. 1 it is argued that systems of logic are exceptional, but not a priori necessary. Logics are exceptional because they can neither be demonstrated as valid nor be confirmed by observation without entering a circle, and their motivation based on intuition is unreliable. On the other hand, logics do not express a priori necessities of thinking because alternative non-classical logics have been developed. Section 2 reflects the controversies about four major kinds of non-classical logics—multi-valued, intuitionistic, paraconsistent and quantum logics. Its purpose is to show that t

APA, Harvard, Vancouver, ISO, and other styles

27

Sen, Jayanta, та M. K. Chakraborty. "Linear Logic and Lukasiewicz ℵ0- Valued Logic: A Logico-Algebraic Study". Journal of Applied Non-Classical Logics 11, № 3-4 (2001): 313–29. http://dx.doi.org/10.3166/jancl.11.313-329.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Gadducci, Fabio, and Ugo Montanari. "Comparing logics for rewriting: rewriting logic, action calculi and tile logic." Theoretical Computer Science 285, no. 2 (2002): 319–58. http://dx.doi.org/10.1016/s0304-3975(01)00362-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Devyatkin, Leonid Yu. "On the three-valued expansions of Kleene's logic." Logical Investigations 29, no. 2 (2023): 59–88. http://dx.doi.org/10.21146/2074-1472-2023-29-2-59-88.

Full text

Abstract:

The paper is devoted to one of the most famous three-valued systems – Kleene's logic. The expressive capabilities of Kleene's logic and its three-valued expansions are described. We present two results. First, all possible three-valued expansions of Kleene's logic are found up to equivalence with respect to the mutual definability of connectives. It is shown that there are only twelve such expansions. This list includes both logics already known in the literature and completely new ones. For the found expansions, we describe the structure of the lattice ordered relative to the expressive power

APA, Harvard, Vancouver, ISO, and other styles

30

Gehrke, Mai, Carol Walker, and Elbert Walker. "A Mathematical Setting for Fuzzy Logics." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 05, no. 03 (1997): 223–38. http://dx.doi.org/10.1142/s021848859700021x.

Full text

Abstract:

The setup of a mathematical propositional logic is given in algebraic terms, describing exactly when two choices of truth value algebras give the same logic. The propositional logic obtained when the algebra of truth values is the real numbers in the unit interval equipped with minimum, maximum and -x=1-x for conjunction, disjunction and negation, respectively, is the standard propositional fuzzy logic. This is shown to be the same as three-valued logic. The propositional logic obtained when the algebra of truth values is the set {(a, b)|a≤ b and a,b∈[0,1]} of subintervals of the unit interval

APA, Harvard, Vancouver, ISO, and other styles

31

Маркин, В. И. "What trends in non-classical logic were anticipated by Nikolai Vasiliev?" Logical Investigations 19 (April 9, 2013): 122–35. http://dx.doi.org/10.21146/2074-1472-2013-19-0-122-135.

Full text

Abstract:

In this paper we discuss a question about the trends in non-classical logic that were exactly anticipated by Niko- lai Vasiliev. We show the influence of Vasiliev’s Imaginary logic on paraconsistent logic. Metatheoretical relations between Vasiliev’s logical systems and many-valued predicate logics are established. We also make clear that Vasiliev has developed a sketch of original system of intensional logic and expressed certain ideas of modal and temporal logics.

APA, Harvard, Vancouver, ISO, and other styles

32

Dardinier, Thibault, and Peter Müller. "Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties." Proceedings of the ACM on Programming Languages 8, PLDI (2024): 1485–509. http://dx.doi.org/10.1145/3656437.

Full text

Abstract:

Hoare logics are proof systems that allow one to formally establish properties of computer programs. Traditional Hoare logics prove properties of individual program executions (such as functional correctness). Hoare logic has been generalized to prove also properties of multiple executions of a program (so-called hyperproperties, such as determinism or non-interference). These program logics prove the absence of (bad combinations of) executions. On the other hand, program logics similar to Hoare logic have been proposed to disprove program properties (e.g., Incorrectness Logic), by proving the

APA, Harvard, Vancouver, ISO, and other styles

33

Dahlmann, Frederik, and Johanne Grosvold. "Environmental Managers and Institutional Work: Reconciling Tensions of Competing Institutional Logics." Business Ethics Quarterly 27, no. 2 (2017): 263–91. http://dx.doi.org/10.1017/beq.2016.65.

Full text

Abstract:

ABSTRACT:Firms face a variety of institutional logics and one important question is how individuals within firms manage these logics. Environmental managers in particular face tensions in reconciling their firms’ commercial fortunes with demands for greater environmental responsiveness. We explore how institutional work enables environmental managers to respond to competing institutional logics. Drawing on repeated interviews with 55 firms, we find that environmental managers face competition between a market-based logic and an emerging environmental logic. We show that some environmental mana

APA, Harvard, Vancouver, ISO, and other styles

34

Widlok, Thomas, and Keith Stenning. "Seeking Common Cause between Cognitive Science and Ethnography: Alternative Logic in Cooperative Action." Journal of Cognition and Culture 18, no. 1-2 (2018): 1–30. http://dx.doi.org/10.1163/15685373-12340027.

Full text

Abstract:

Abstract Alternative logics have been invoked periodically to explain the systematically diﬀerent modes of thought of the subjects of ethnography: one logic for ‘us’ and another for ‘them’. Recently anthropologists have cast doubt on the tenability of such an explanation of diﬀerence. In cognitive science, [Stenning and van Lambalgen, 2008] proposed that with the modern development of multiple logics, at least several logics are required for making sense of the cognitive processes of reasoning for diﬀerent purposes and in diﬀerent contexts. Alongside Classical logic (CL) — the logic of dispute

APA, Harvard, Vancouver, ISO, and other styles

35

Xiong, Liping, та Sumei Guo. "Representation and Reasoning about Strategic Abilities with ω-Regular Properties". Mathematics 9, № 23 (2021): 3052. http://dx.doi.org/10.3390/math9233052.

Full text

Abstract:

Specification and verification of coalitional strategic abilities have been an active research area in multi-agent systems, artificial intelligence, and game theory. Recently, many strategic logics, e.g., Strategy Logic (SL) and alternating-time temporal logic (ATL*), have been proposed based on classical temporal logics, e.g., linear-time temporal logic (LTL) and computational tree logic (CTL*), respectively. However, these logics cannot express general ω-regular properties, the need for which are considered compelling from practical applications, especially in industry. To remedy this proble

APA, Harvard, Vancouver, ISO, and other styles

36

Avron, Arnon. "Natural 3-valued logics—characterization and proof theory." Journal of Symbolic Logic 56, no. 1 (1991): 276–94. http://dx.doi.org/10.2307/2274919.

Full text

Abstract:

Many-valued logics in general and 3-valued logic in particular is an old subject which had its beginning in the work of Łukasiewicz [Łuk]. Recently there is a revived interest in this topic, both for its own sake (see, for example, [Ho]), and also because of its potential applications in several areas of computer science, such as proving correctness of programs [Jo], knowledge bases [CP] and artificial intelligence [Tu]. There are, however, a huge number of 3-valued systems which logicians have studied throughout the years. The motivation behind them and their properties are not always clear,

APA, Harvard, Vancouver, ISO, and other styles

37

Angel, Garrido, and Yuste Piedad. "BRAIN Journal - Controversies about the Introduction of Non-Classical Logics." BRAIN - Broad Research in Artificial Intelligence and Neuroscience 5, no. 1-5 (2014): 34–45. https://doi.org/10.5281/zenodo.1044117.

Full text

Abstract:

ABSTRACT Logic is a set of well-formed formulae, along with an inference relation. But the Classical Logic is bivalent; for this reason, very limited to solve problems with uncertainty on the data. It is well-known that Artificial Intelligence requires Logic. Because its Classical version shows too many insufficiencies, it is very necessary to introduce more sophisticated tools, as may be NonClassical Logics; amongst them, Fuzzy Logic, Modal Logic, Non-Monotonic Logic, Para-consistent Logic, and so on. All them in the same line: against the dogmatism and the dualistic vision of the world: abso

APA, Harvard, Vancouver, ISO, and other styles

38

Kondratyev, Dmitry A. "Logic for reasoning about bugs in loops over data sequences (IFIL)." Modeling and Analysis of Information Systems 30, no. 3 (2023): 214–33. http://dx.doi.org/10.18255/1818-1015-2023-3-214-233.

Full text

Abstract:

Classic deductive verification is not focused on reasoning about program incorrectness. Reasoning about program incorrectness using formal methods is an important problem nowadays. Special logics such as Incorrectness Logic, Adversarial Logic, Local Completeness Logic, Exact Separation Logic and Outcome Logic have recently been proposed to address it. However, these logics have two disadvantages. One is that they are based on under-approximation approaches, while classic deductive verification is based on the over-approximation approach. One the other hand, the use of the classic approach requ

APA, Harvard, Vancouver, ISO, and other styles

39

KAMIDE, NORIHIRO. "Embedding theorems for LTL and its variants." Mathematical Structures in Computer Science 25, no. 1 (2014): 83–134. http://dx.doi.org/10.1017/s0960129514000048.

Full text

Abstract:

In this paper, we prove some embedding theorems for LTL (linear-time temporal logic) and its variants:viz. some generalisations, extensions and fragments of LTL. Using these embedding theorems, we give uniform proofs of the completeness, cut-elimination and/or decidability theorems for LTL and its variants. The proposed embedding theorems clarify the relationships between some LTL-variations (for example, LTL, a dynamic topological logic, a fixpoint logic, a spatial logic, Prior's logic, Davies' logic and an NP-complete LTL) and some traditional logics (for example, classical logic, intuitioni

APA, Harvard, Vancouver, ISO, and other styles

40

DYCK, Corey W. "THE PRIORITY OF JUDGING: KANT ON WOLFF’S GENERAL LOGIC." Estudos Kantianos [EK] 4, no. 02 (2017): 99–118. http://dx.doi.org/10.36311/2318-0501.2016.v4n2.07.p99.

Full text

Abstract:

One would be forgiven for suspecting that Kant did not think much of Christian Wolff’s contributions to logic. Wolff’s works on logic are, of course, implicated in Kant’s far-ranging verdict that the discipline has not taken a single step forward since Aristotle’s time, and Wolff in particular frequently comes up for criticism in Kant’s own lectures on the topic. In the Wiener Logik, for example, Kant is reported as referring to Wolff’s claim that the content of a concept can be completely analysed as “too dictatorial” and that as a result Wolff’s attempts to ground his philosophy on the preci

APA, Harvard, Vancouver, ISO, and other styles

41

Hannula, Miika, Juha Kontinen, and Jonni Virtema. "Polyteam semantics." Journal of Logic and Computation 30, no. 8 (2020): 1541–66. http://dx.doi.org/10.1093/logcom/exaa048.

Full text

Abstract:

Abstract Team semantics is the mathematical framework of modern logics of dependence and independence in which formulae are interpreted by sets of assignments (teams) instead of single assignments as in first-order logic. In order to deepen the fruitful interplay between team semantics and database dependency theory, we define Polyteam Semantics in which formulae are evaluated over a family of teams. We begin by defining a novel polyteam variant of dependence atoms and give a finite axiomatization for the associated implication problem. We relate polyteam semantics to team semantics and invest

APA, Harvard, Vancouver, ISO, and other styles

42

Hu, Zhi Ming, Zhong Qi Wang, Ning Li, and Hui Ping Wang. "Description Logics in Information Semantic Integration for Product Design and Manufacturing." Advanced Materials Research 542-543 (June 2012): 251–54. http://dx.doi.org/10.4028/www.scientific.net/amr.542-543.251.

Full text

Abstract:

In the process of information semantic integration for product design and manufacturing, it is very important to express the product information semantic. Description logics (DLs) are a family of state-of-the-art knowledge representation languages, and a decidable subset of first-order logic. Firstly, by analyzing the characteristics of product information, proposed a semantic information description framework based on description logics for product information integration, which is divided into three levels: basic description logic, classic extended logic and unusual extended logic. Then, in

APA, Harvard, Vancouver, ISO, and other styles

43

Demey, Lorenz. "Logic-Sensitivity of Aristotelian Diagrams in Non-Normal Modal Logics." Axioms 10, no. 3 (2021): 128. http://dx.doi.org/10.3390/axioms10030128.

Full text

Abstract:

Aristotelian diagrams, such as the square of opposition, are well-known in the context of normal modal logics (i.e., systems of modal logic which can be given a relational semantics in terms of Kripke models). This paper studies Aristotelian diagrams for non-normal systems of modal logic (based on neighborhood semantics, a topologically inspired generalization of relational semantics). In particular, we investigate the phenomenon of logic-sensitivity of Aristotelian diagrams. We distinguish between four different types of logic-sensitivity, viz. with respect to (i) Aristotelian families, (ii)

APA, Harvard, Vancouver, ISO, and other styles

44

BESSON, CORINE. "EXTERNALISM, INTERNALISM, AND LOGICAL TRUTH." Review of Symbolic Logic 2, no. 1 (2009): 1–29. http://dx.doi.org/10.1017/s1755020309090091.

Full text

Abstract:

The aim of this paper is to show what sorts of logics are required by externalist and internalist accounts of the meanings of natural kind nouns. These logics give us a new perspective from which to evaluate the respective positions in the externalist--internalist debate about the meanings of such nouns. The two main claims of the paper are the following: first, that adequate logics for internalism and externalism about natural kind nouns are second-order logics; second, that an internalist second-order logic is a free logic—a second order logic free of existential commitments for natural kind

APA, Harvard, Vancouver, ISO, and other styles

45

Rimatskiy, V. V. "Admissible Inference Rules and Semantic Property of Modal Logics." Bulletin of Irkutsk State University. Series Mathematics 37 (2021): 104–17. http://dx.doi.org/10.26516/1997-7670.2021.37.104.

Full text

Abstract:

Firstly semantic property of nonstandart logics were described by formulas which are peculiar to studied a models in general, and do not take to consideration a variable conditions and a changing assumptions. Evidently the notion of inference rule generalizes the notion of formulas and brings us more flexibility and more expressive power to model human reasoning and computing. In 2000-2010 a few results on describing of explicit bases for admissible inference rules for nonstandard logics (S4, K4, H etc.) appeared. The key property of these logics was weak co-cover property. Beside the improvem

APA, Harvard, Vancouver, ISO, and other styles

46

ALIZADEH, MAJID, FARZANEH DERAKHSHAN, and HIROAKIRA ONO. "UNIFORM INTERPOLATION IN SUBSTRUCTURAL LOGICS." Review of Symbolic Logic 7, no. 3 (2014): 455–83. http://dx.doi.org/10.1017/s175502031400015x.

Full text

Abstract:

AbstractUniform interpolation property of a given logic is a stronger form of Craig’s interpolation property where both pre-interpolant and post-interpolant always exist uniformly for any provable implication in the logic. It is known that there exist logics, e.g., modal propositional logic S4, which have Craig’s interpolation property but do not have uniform interpolation property. The situation is even worse for predicate logics, as classical predicate logic does not have uniform interpolation property as pointed out by L. Henkin.In this paper, uniform interpolation property of basic substru

APA, Harvard, Vancouver, ISO, and other styles

47

Jin, Chen. "A review on multiple-valued logic circuits." Applied and Computational Engineering 43, no. 1 (2024): 322–26. http://dx.doi.org/10.54254/2755-2721/43/20230857.

Full text

Abstract:

Since the traditional binary logic has several disadvantages including inaccuracy, high complexity, and limited applications. Multiple-Valued Logic (MVL), which can store more information in one digit than binary logics, require less number of logic gates and take the third value in practical logic problems, is developed and introduced. More information stored per digit leads to higher computational efficiency. Less logic gates results in more spaces on the circuit board. Considering the third value means higher accuracy. In this research, some examples of different MVL circuit are designed to

APA, Harvard, Vancouver, ISO, and other styles

48

Castro-Manzano, J. Martín. "on a tableaux method for a synthetic term logic." Signos Filosoficos 25, no. 50 (2023): 120–54. http://dx.doi.org/10.24275/sfilo.v25n50.07.

Full text

Abstract:

Combining logics is usually done with respect to Fregean-Tarskian-Kripkean systems, but since logic does not need to be restricted to this received view of logic, in this work we reproduce a synthetic logic of terms à la Sommers together with a tableaux proof method, and we show some of its metatheoretical properties. In particular, we show that the logics we synthetize can be properly combined and that the synthetic tableaux method preserves the properties of the tableaux methods of each basic logic.

APA, Harvard, Vancouver, ISO, and other styles

49

Metcalfe, George, and Franco Montagna. "Substructural fuzzy logics." Journal of Symbolic Logic 72, no. 3 (2007): 834–64. http://dx.doi.org/10.2178/jsl/1191333844.

Full text

Abstract:

AbstractSubstructural fuzzy logics are substructural logics that are complete with respect to algebras whose lattice reduct is the real unit interval [0, 1]. In this paper, we introduce Uninorm logic UL as Multiplicative additive intuitionistic linear logic MAILL extended with the prelinearity axiom ((A → B) ∧ t) V ((B → A)∧ t). Axiomatic extensions of UL include known fuzzy logics such as Monoidal t-norm logic MIX and Gödel logic G, and new weakening-free logics. Algebraic semantics for these logics are provided by subvarieties of (representable) pointed bounded commutative residuated lattice

APA, Harvard, Vancouver, ISO, and other styles

50

Standefer, Shawn. "Tracking reasons with extensions of relevant logics." Logic Journal of the IGPL 27, no. 4 (2019): 543–69. http://dx.doi.org/10.1093/jigpal/jzz018.

Full text

Abstract:

Abstract In relevant logics, necessary truths need not imply each other. In justification logic, necessary truths need not all be justified by the same reason. There is an affinity to these two approaches that suggests their pairing will provide good logics for tracking reasons in a fine-grained way. In this paper, I will show how to extend relevant logics with some of the basic operators of justification logic in order to track justifications or reasons. I will define and study three kinds of frames for these logics. For the first kind of frame, I show soundness and highlight a difficulty in

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!