Log in

Relevant bibliographies by topics / Question (Logic) / Journal articles

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

Journal articles on the topic 'Question (Logic)'

Author: Grafiati

Published: 4 June 2021

Last updated: 31 July 2024

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 'Question (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

Girle, Roderic A., and Jonathan McKeown-Green. "Methodological Issues for the Logic of Questions and Commands." International Journal of Cognitive Informatics and Natural Intelligence 6, no. 3 (July 2012): 1–18. http://dx.doi.org/10.4018/jcini.2012070101.

Full text

Abstract:

There has been much recent interest in logics for questions and commands. The authors approve, but they argue that methodological issues must be addressed, before it is possible to understand what such logics are for and what they should be like. In particular, the authors deny that the formulas in such logics correspond directly to sentences in ordinary language. Logic is not linguistics. What then are the semantics for the formulas of logics of questions and commands? The focus here is mostly on questions. The authors argue that logics designed to capture the conditions for correct reasoning involving questions require a semantics that treats question-answer pairs as values. They also argue that formal dialogue approaches to the logic of questions should be interpreted in the light of the denial that logic is about language.

APA, Harvard, Vancouver, ISO, and other styles

2

Trzęsicki, Kazimierz. "Indeterministic Temporal Logic." Studies in Logic, Grammar and Rhetoric 42, no. 1 (September 1, 2015): 139–62. http://dx.doi.org/10.1515/slgr-2015-0034.

Full text

Abstract:

Abstract The questions od determinism, causality, and freedom have been the main philosophical problems debated since the beginning of temporal logic. The issue of the logical value of sentences about the future was stated by Aristotle in the famous tomorrow sea-battle passage. The question has inspired Łukasiewicz’s idea of many-valued logics and was a motive of A. N. Prior’s considerations about the logic of tenses. In the scheme of temporal logic there are different solutions to the problem. In the paper we consider indeterministic temporal logic based on the idea of temporal worlds and the relation of accessibility between them.

APA, Harvard, Vancouver, ISO, and other styles

3

Furbach, Ulrich, Ingo Glöckner, Hermann Helbig, and Björn Pelzer. "Logic-Based Question Answering." KI - Künstliche Intelligenz 24, no. 1 (February 5, 2010): 51–55. http://dx.doi.org/10.1007/s13218-010-0010-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Zhelnin, Anton Igorevich. "Objective embodiment of logic: from computational machines to life and intelligence?" Философская мысль, no. 2 (February 2024): 34–48. http://dx.doi.org/10.25136/2409-8728.2024.2.69896.

Full text

Abstract:

The subject of article is a critical analysis of the objectification of logic and, in particular, the idea of its embodiment in the living. The question of the essence and boundaries of the concept of bio-logic is raised and considered. The problem of logics's embodiment raises from its fuzzy ontological status. The novelty of the study lies in that it shows that the solution of the question of bio-logic directly depends on the question of the essence of logics as such, the views on which has gone through strong transformations during its history. Idea of logic's objectivization has became possible due to not only conceptual philosophical constructions, but also the computational revolution, which made practical implementation of logical principles in the functioning of computing machines possible. Concept of logic has subtly expanded and transformed into the idea of orderliness and algorithmicity. It is shown that such an expansive interpretation of the logical is not applicable to biosystems, because they are living totalities, where everything is reciprocal and continuously interconnected. Even such computationally similar systems as the genome and the brain turn out to be autopoietic entities that nonlinearly create themselves without following formal rules. Paradoxically, the intelligence, which was considered the cradle of logic, also turns out to be flexible and adaptive, because it is also rooted in biology. The vital fundament of living intelligence prevents its artificial modelling through logico-computational and algorithmic phenomena. Main conclusion is that question of bio-logic depends on the optics of considering logic as such, and is also associated with bio-ontology, an understanding of the essence of life. Our analysis shows that there are not sufficient grounds to recognize the existence of a special biological logic immanent to living things, which, however, has potential as a philosophical and scientific metaphor.

APA, Harvard, Vancouver, ISO, and other styles

5

Shirley, Greg. "Logic: The Question of Truth." History and Philosophy of Logic 32, no. 2 (May 2011): 193–96. http://dx.doi.org/10.1080/01445340.2010.543360.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Маркин, В. И. "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

7

Kuznetsov, Stepan. "Action Logic is Undecidable." ACM Transactions on Computational Logic 22, no. 2 (May 15, 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 logic and infinitary action logic, for fragments of these logics with only one of the two lattice (additive) connectives, and for action logic extended with the law of distributivity.

APA, Harvard, Vancouver, ISO, and other styles

8

Oliveira, Kleidson Êglicio Carvalho da Silva. "Paraconsistent Logic Programming in Three and Four-Valued Logics." Bulletin of Symbolic Logic 28, no. 2 (June 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 studied is the paraconsistent, that is, the reasoning that tolerates contradictions. However, although there are many paraconsistent logics with different types of semantics, their application to logic programming is more delicate than it first appears, requiring an in-depth study of what can or cannot be transferred directly from classical first-order logic to other types of logic.Based on studies of Tarcisio Rodrigues on the foundations of Paraconsistent Logic Programming (2010) for some Logics of Formal Inconsistency (LFIs), this thesis intends to resume the research of Rodrigues and place it in the specific context of LFIs with three- and four-valued semantics. This kind of logics are interesting from the computational point of view, as presented by Luiz Silvestrini in his Ph.D. thesis entitled “A new approach to the concept of quase-truth” (2011), and by Marcelo Coniglio and Martín Figallo in the article “Hilbert-style presentations of two logics associated to tetravalent modal algebras” [Studia Logica (2012)]. Based on original techniques, this study aims to define well-founded systems of paraconsistent logic programming based on well-known logics, in contrast to the ad hoc approaches to this question found in the literature.Abstract prepared by Kleidson Êglicio Carvalho da Silva Oliveira.E-mail: kecso10@yahoo.com.brURL: http://repositorio.unicamp.br/jspui/handle/REPOSIP/322632

APA, Harvard, Vancouver, ISO, and other styles

9

Somerville, James. "Collingwood’s Logic of Question and Answer." Monist 72, no. 4 (1989): 526–41. http://dx.doi.org/10.5840/monist198972427.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Achilleos, Antonis. "A complexity question in justification logic." Journal of Computer and System Sciences 80, no. 6 (September 2014): 1038–45. http://dx.doi.org/10.1016/j.jcss.2014.03.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Somerville, James. "Time and Interrogative Logical Form." Philosophy 76, no. 1 (January 2001): 55–75. http://dx.doi.org/10.1017/s0031819101000055.

Full text

Abstract:

Despite some talk of ‘erotetic logic’ and ‘the logic of interrogatives’, logicians have hitherto completely overlooked the peculiar logical form of questions, also shared by interrogative clauses generally. Of relevance to an understanding of time are those interrogative clauses that are janus-like: sometimes raising a question, sometimes answering it—which can then no longer arise. Since a closed question can no longer arise, it might seem that simply the passing of time turns an open into a closed question. Instead, the passing of time itself can be understood as the closing or resolution of open questions, of the determination of what is not fixed but as yet in question.

APA, Harvard, Vancouver, ISO, and other styles

12

Jonkisz, Adam. "The role of the notion of a proper answer in the logic of questions." Rocznik Filozoficzny Ignatianum 27, no. 1 (December 30, 2021): 319–40. http://dx.doi.org/10.35765/rfi.2021.2701.16.

Full text

Abstract:

The observations in the article mainly concern the role of the concept of the so-called right answer in question logic. The purpose of these remarks is to justify the postulate that any logic of questions should be based on a conception of the structure of questions and answers, in which the notion of a proper answer is strictly defined. This postulate is addressed to any question logic, although it is mainly supported and illustrated by analyses and comparative remarks referring to concepts based on Ajdukiewicz’s question theory and to recent approaches of inferential erotetic logic (IEL). The analyses confirm that the concept of proper answer is fundamental in question theories, as it is assumed in the definitions of almost all concepts relating to questions and answers. In Ajdukiewicz’s concept, it is used explicitly, for example, in the definitions of the conditions of proper questioning and of complete and exhaustive answers. In IEL, it appears explicitly in the definitions of: the pertinent question, the notion of the presupposition of a question (and its variations), the relations of evoking a question (by a set of indicative sentences) and implying a question (by another question), etc. This basic concept should therefore be well defined. This postulate applies especially to such theories of questions in which assertions about questions and answers are proved in symbolic language – as is the case in IEL, which, however, lacks a strict definition of the concept of proper answer (there are only vague, pragmatic terms formulated in natural language). There is, however, a definition that is closer to the idea of the proper answer, adopted by Ajdukiewicz as well as in the concepts related to it, that a proper answer is one the structure of which is determined by the scheme of the question structure. However, this definition should be complemented by an accurate and general conception of question structure, which is lacking in the existing concepts. In order to confirm the validity of the formulated postulate, the article proposes new results achieved in the theory of questions, in which Ajdukiewicz’s ideas are developed and supplemented by a full account of the structure of questions and well-defined, i.e. formulated in a general and strict way as is the idea of proper answer.

APA, Harvard, Vancouver, ISO, and other styles

13

Morozov, A. S. "Higman’s question revisited." Algebra and Logic 39, no. 2 (March 2000): 78–83. http://dx.doi.org/10.1007/bf02681662.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Gencer, Çi??dem, and Mehmet Terziler. "On a Question of Phillips." Mathematical Logic Quarterly 43, no. 1 (1997): 78–82. http://dx.doi.org/10.1002/malq.19970430110.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Masini, Andrea, and Margherita Zorzi. "A Logic for Quantum Register Measurements." Axioms 8, no. 1 (February 24, 2019): 25. http://dx.doi.org/10.3390/axioms8010025.

Full text

Abstract:

We know that quantum logics are the most prominent logical systems associated to the lattices of closed Hilbert subspaces. However, what happen if, following a quantum computing perspective, we want to associate a logic to the process of quantum registers measurements? This paper gives an answer to this question, and, quite surprisingly, shows that such a logic is nothing else that the standard propositional intuitionistic logic.

APA, Harvard, Vancouver, ISO, and other styles

16

Dahlmann, Frederik, and Johanne Grosvold. "Environmental Managers and Institutional Work: Reconciling Tensions of Competing Institutional Logics." Business Ethics Quarterly 27, no. 2 (February 27, 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 managers embed the environmental logic alongside the market logic through variations of creation and disruption, thus over time creating institutional change, which can result in blended logics. Others, however, pursue a strategy of status quo or disengagement through maintenance or other forms of disruption, where the two logics coexist in principle but not in practice; instead the market logic retains its dominance. We discuss the implications of our findings for research.

APA, Harvard, Vancouver, ISO, and other styles

17

Rybakov, Mikhail, and Dmitry Shkatov. "Recursive enumerability and elementary frame definability in predicate modal logic." Journal of Logic and Computation 30, no. 2 (December 20, 2019): 549–60. http://dx.doi.org/10.1093/logcom/exz028.

Full text

Abstract:

Abstract We investigate the relationship between recursive enumerability and elementary frame definability in first-order predicate modal logic. On one hand, it is well known that every first-order predicate modal logic complete with respect to an elementary class of Kripke frames, i.e. a class of frames definable by a classical first-order formula, is recursively enumerable. On the other, numerous examples are known of predicate modal logics, based on ‘natural’ propositional modal logics with essentially second-order Kripke semantics, that are either not recursively enumerable or Kripke incomplete. This raises the question of whether every Kripke complete, recursively enumerable predicate modal logic can be characterized by an elementary class of Kripke frames. We answer this question in the negative, by constructing a normal predicate modal logic which is Kripke complete, recursively enumerable, but not complete with respect to an elementary class of frames. We also present an example of a normal predicate modal logic that is recursively enumerable, Kripke complete, and not complete with respect to an elementary class of rooted frames, but is complete with respect to an elementary class of frames that are not rooted.

APA, Harvard, Vancouver, ISO, and other styles

18

Ferrell, Robyn. "The Timing of Feminism." Hypatia 14, no. 1 (1999): 38–48. http://dx.doi.org/10.1111/j.1527-2001.1999.tb01038.x.

Full text

Abstract:

Is history a category of reason, or is reason a category of history? These opposing questions have divided the structuralist from the materialist—but neither question is wrong. Analysis of the logic of oppositions challenges feminism, in particular, to find a logic—and a poetics—in which to render its values without historical or theoretical naiveté. I explore the question of the timing of feminism through Julia Kristeva and Luce Irigaray.

APA, Harvard, Vancouver, ISO, and other styles

19

Riley, Dylan. "The Historical Logic of Logics of History." Social Science History 32, no. 4 (2008): 555–65. http://dx.doi.org/10.1017/s014555320001083x.

Full text

Abstract:

How does the logic of language combine with the logic of labor to explain historical change? This article suggests that William H. Sewell Jr.'s work can be divided into three periods, each characterized by a different answer to this question. In the work of the early cultural turn, labor and language codetermine historical change; in that of the high cultural turn, the logic of language becomes dominant; and in that of the postcultural turn, labor returns to a more central position. The article argues that these shifts result from tensions in Sewell's account of historical change and suggests a comparison with Jürgen Habermas's account of work and interaction.

APA, Harvard, Vancouver, ISO, and other styles

20

Kotlarski, Henryk, and Konrad Zdanowski. "On a question of Andreas Weiermann." MLQ 55, no. 2 (February 2009): 201–11. http://dx.doi.org/10.1002/malq.200710089.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Morozov, A. S. "A question of Higman." Algebra and Logic 29, no. 1 (January 1990): 22–26. http://dx.doi.org/10.1007/bf01980217.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

HOLLIDAY, WESLEY H., and TADEUSZ LITAK. "COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS." Review of Symbolic Logic 12, no. 3 (July 4, 2019): 487–535. http://dx.doi.org/10.1017/s1755020317000259.

Full text

Abstract:

AbstractIn this article, we tell a story about incompleteness in modal logic. The story weaves together an article of van Benthem (1979), “Syntactic aspects of modal incompleteness theorems,” and a longstanding open question: whether every normal modal logic can be characterized by a class ofcompletely additivemodal algebras, or as we call them,${\cal V}$-baos. Using a first-order reformulation of the property of complete additivity, we prove that the modal logic that starred in van Benthem’s article resolves the open question in the negative. In addition, for the case of bimodal logic, we show that there is a naturally occurring logic that is incomplete with respect to${\cal V}$-baos, namely the provability logic$GLB$(Japaridze, 1988; Boolos, 1993). We also show that even logics that are unsound with respect to such algebras do not have to be more complex than the classical propositional calculus. On the other hand, we observe that it is undecidable whether a syntactically defined logic is${\cal V}$-complete. After these results, we generalize the Blok Dichotomy (Blok, 1978) to degrees of${\cal V}$-incompleteness. In the end, we return to van Benthem’s theme of syntactic aspects of modal incompleteness.

APA, Harvard, Vancouver, ISO, and other styles

23

Решетников and Sergey Reshetnikov. "Information and Communication: to the Question about the Formation of Meaning." Modern Communication Studies 3, no. 5 (October 10, 2014): 16–22. http://dx.doi.org/10.12737/5741.

Full text

Abstract:

The article continues the series of publications of the author, which take up the conclusions, following from a very general definition of communication as interaction. In this case we are talking about the problems of the sense creation and scientific truths, which are considered from the point of view of dualism logics of the cognizing subject: the logic of immobility, under which the author refers to the thinking and the logic of motion, i.e. tacit knowledge, a prerequisite for successful (appropriate) the use of which is to stop thinking. The presented position allows you to take the issues raised in aporia Zeno (the tasks they recognize insoluble) and a new angle of vision to see the dichotomy of analysis and synthesis, rationality and irrationality, similarity and hierarchy, as well as other concepts.

APA, Harvard, Vancouver, ISO, and other styles

24

Raikhert, Kostiantyn. "THE QUESTION OF THE SUBJECT BELONGING OF PLAUSIBLE REASONING." Doxa, no. 2(40) (December 21, 2023): 25–32. http://dx.doi.org/10.18524/2410-2601.2023.2(40).307197.

Full text

Abstract:

The study questions the subject belonging of plausible reasoning. Traditionally, logic is considered the discipline concerned with plausible reasoning, including analogy and induction. Nevertheless, heuristics, probability theory, and heuristic logic as a hybrid of logic and heuristics also claim to study plausible reasoning. The claims of the four disciplines can be explained by the fact that there are no commonly agreed definitions of the concepts of “probability”, “logic”, and “heuristics” amongst scholars, scientists, and philosophers, and thereby no well-defined research domains to which these disciplines (probability theory, logic, and heuristics, respectively) are applied, given the lack of unity among scholars, scientists, and philosophers both within and outside their own disciplines. The lack of unity among scholars, scientists, and philosophers can be explained by the diversity of approaches, movements, schools, traditions, and trends, the vast amounts of data, and all sorts of expansions, interventions, and differentiations of disciplines.

APA, Harvard, Vancouver, ISO, and other styles

25

Tana. "Exploration and Practice of Question-based Teaching Method in University Digital Logic Course." International Journal of Education and Humanities 14, no. 3 (June 16, 2024): 84–88. http://dx.doi.org/10.54097/j2618243.

Full text

Abstract:

This paper mainly discusses the application of question-based teaching method in digital logic course of university. By raising questions related to the course content before class, this method guides students to think and explore independently, aiming to improve students' learning initiative and promote knowledge in-depth understanding and long-term memory. The results show that the question-based teaching method can effectively improve students' learning effect and interest, and provide useful practical experience for the teaching reform of digital logic course.

APA, Harvard, Vancouver, ISO, and other styles

26

Wang, Yi, Joohyung Lee, and Doo Kim. "A Logic Based Approach to Answering Questions about Alternatives in DIY Domains." Proceedings of the AAAI Conference on Artificial Intelligence 31, no. 2 (February 11, 2017): 4753–58. http://dx.doi.org/10.1609/aaai.v31i2.19106.

Full text

Abstract:

Many question answering systems have primarily focused on factoid questions. These systems require the answers to be explicitly stored in a knowledge base (KB) but due to this requirement, they fail to answer many questions for which the answers cannot be pre-formulated. This paper presents a question answering system which aims at answering nonfactoid questions in the DIY domain using logic-based reasoning. Specifically, the system uses Answer Set Programming to derive an answer by combining various types of knowledge such as domain and commonsense knowledge. We showcase the system by answering one specific type of questions — questions about alternatives. The evaluation result shows that our logic-based reasoning together with the KB (constructed from texts using Information Extraction) significantly improves the user experience.

APA, Harvard, Vancouver, ISO, and other styles

27

Miller, Joseph S., and André Nies. "Randomness and Computability: Open Questions." Bulletin of Symbolic Logic 12, no. 3 (September 2006): 390–410. http://dx.doi.org/10.2178/bsl/1154698740.

Full text

Abstract:

It is time for a new paper about open questions in the currently very active area of randomness and computability. Ambos-Spies and Kučera presented such a paper in 1999 [1]. All the question in it have been solved, except for one: is KL-randomness different from Martin-Löf randomness? This question is discussed in Section 6.Not all the questions are necessarily hard—some simply have not been tried seriously. When we think a question is a major one, and therefore likely to be hard, we indicate this by the symbol ▶, the criterion being that it is of considerable interest and has been tried by a number of researchers. Some questions are close contenders here; these are marked by ▷. With few exceptions, the questions are precise. They mostly have a yes/no answer. However, there are often more general questions of an intuitive or even philosophical nature behind. We give an outline, indicating the more general questions.All sets will be sets of natural numbers, unless otherwise stated. These sets are identified with infinite strings over {0, 1}. Other terms used in the literature are sequence and real.

APA, Harvard, Vancouver, ISO, and other styles

28

Mason, Ian. "The metatheory of the classical propositional calculus is not axiomatizable." Journal of Symbolic Logic 50, no. 2 (June 1985): 451–57. http://dx.doi.org/10.2307/2274233.

Full text

Abstract:

In this paper we investigate the first order metatheory of the classical propositional logic. In the first section we prove that the first order metatheory of the classical propositional logic is undecidable. Thus as a mathematical object even the simplest of logics is, from a logical standpoint, quite complex. In fact it is of the same complexity as true first order number theory.This result answers negatively a question of J. F. A. K. van Benthem (see [van Benthem and Doets 1983]) as to whether the interpolation theorem in some sense completes the metatheory of the calculus. Let us begin by motivating the question that we answer. In [van Benthem and Doets 1983] it is claimed that a folklore prejudice has it that interpolation was the final elementary property of first order logic to be discovered. Even though other properties of the propositional calculus have been discovered since Craig's orginal paper [Craig 1957] (see for example [Reznikoff 1965]) there is a lot of evidence for the fundamental nature of the property. In abstract model theory for example one finds that very few logics have the interpolation property. There are two well-known open problems in this area. These are1. Is there a logic satisfying the full compactness theorem as well as the interpolation theorem that is not equivalent to first order logic even for finite models?2. Is there a logic stronger than L(Q), the logic with the quantifierthere exist uncountably many, that is countably compact and has the interpolation property?

APA, Harvard, Vancouver, ISO, and other styles

29

Purdy, William C. "On the question ``do we need identity?''." Notre Dame Journal of Formal Logic 33, no. 4 (September 1992): 593–603. http://dx.doi.org/10.1305/ndjfl/1093634491.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Patton, Thomas E. "On begging the question ``Who is $N$?''." Notre Dame Journal of Formal Logic 29, no. 4 (September 1988): 553–62. http://dx.doi.org/10.1305/ndjfl/1093638019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Weaver, George, and Benjamin George. "The Fraenkel-Carnap question for Dedekind algebras." MLQ 49, no. 1 (January 2003): 92–96. http://dx.doi.org/10.1002/malq.200310008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Котикова, Е. А., and М. Н. Рыбаков. "First-order logics of branching time." Logical Investigations 19 (April 9, 2013): 68–99. http://dx.doi.org/10.21146/2074-1472-2013-19-0-68-99.

Full text

Abstract:

We consider the logic QCTL, a first-order exten- sion of CTL defined as a logic of Kripke frames for CTL. We study the question about recursive enumerability of its fragments specified by a set of temporal modalities we use. Then we discuss some questions concerned axiomatizability and Kripke completeness.

APA, Harvard, Vancouver, ISO, and other styles

33

Baviskar, Vaishali. "Question Paper Generator." International Journal for Research in Applied Science and Engineering Technology 9, no. VI (June 20, 2021): 2076–78. http://dx.doi.org/10.22214/ijraset.2021.35283.

Full text

Abstract:

Generating question papers is a tedious and time-consuming operation. This study uses Python to construct a fuzzy logic-based model for autonomous paper creation. With the aid of a huge number of questions saved in the database, college officials may create a fully personalised question paper. The programme may be used to produce question papers based on the examination level, which may include unit tests. It enables the authorities to pick and choose from the syllabus's chapters. The programme makes use of a database to use the question paper, which might include hundreds of questions. The programme generates a collection of random questions on which the question does not appear. The programme is a great tool for quickly generating question papers and so saving time and effort.

APA, Harvard, Vancouver, ISO, and other styles

34

Fiore, Camillo. "Classical Logic is Connexive." Australasian Journal of Logic 21, no. 2 (May 23, 2024): 91–99. http://dx.doi.org/10.26686/ajl.v21i2.8352.

Full text

Abstract:

Connexive logics are based on two ideas: that no statement entails or is entailed by its own negation (this is Aristotle's thesis) and that no statement entails both something and the negation of this very thing (this is Boethius thesis). Usually, connexive logics are contra-classical. In this note, I introduce a reading of the connexive theses that makes them compatible with classical logic. According to this reading, the theses in question do not talk about validity alone; rather, they talk in part about (a property related to) the soundness of arguments.

APA, Harvard, Vancouver, ISO, and other styles

35

PAKHOMOV, FEDOR, and ALBERT VISSER. "ON A QUESTION OF KRAJEWSKI’S." Journal of Symbolic Logic 84, no. 1 (March 2019): 343–58. http://dx.doi.org/10.1017/jsl.2018.72.

Full text

Abstract:

AbstractIn this paper, we study finitely axiomatizable conservative extensions of a theory U in the case where U is recursively enumerable and not finitely axiomatizable. Stanisław Krajewski posed the question whether there are minimal conservative extensions of this sort. We answer this question negatively.Consider a finite expansion of the signature of U that contains at least one predicate symbol of arity ≥ 2. We show that, for any finite extension α of U in the expanded language that is conservative over U, there is a conservative extension β of U in the expanded language, such that $\alpha \vdash \beta$ and $\beta \not \vdash \alpha$. The result is preserved when we consider either extensions or model-conservative extensions of U instead of conservative extensions. Moreover, the result is preserved when we replace $\dashv$ as ordering on the finitely axiomatized extensions in the expanded language by a relevant kind of interpretability, to wit interpretability that identically translates the symbols of the U-language.We show that the result fails when we consider an expansion with only unary predicate symbols for conservative extensions of U ordered by interpretability that preserves the symbols of U.

APA, Harvard, Vancouver, ISO, and other styles

36

Gitik, Moti. "On a question of Pereira." Archive for Mathematical Logic 47, no. 1 (May 24, 2008): 53–64. http://dx.doi.org/10.1007/s00153-008-0070-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

CITKIN, ALEX. "HEREDITARILY STRUCTURALLY COMPLETE POSITIVE LOGICS." Review of Symbolic Logic 13, no. 3 (April 23, 2019): 483–502. http://dx.doi.org/10.1017/s1755020319000169.

Full text

Abstract:

AbstractPositive logics are $\{ \wedge , \vee , \to \}$-fragments of intermediate logics. It is clear that the positive fragment of $Int$ is not structurally complete. We give a description of all hereditarily structurally complete positive logics, while the question whether there is a structurally complete positive logic which is not hereditarily structurally complete, remains open.

APA, Harvard, Vancouver, ISO, and other styles

38

KIKOT, STANISLAV, AGI KURUCZ, YOSHIHITO TANAKA, FRANK WOLTER, and MICHAEL ZAKHARYASCHEV. "KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS." Journal of Symbolic Logic 84, no. 02 (April 3, 2019): 533–88. http://dx.doi.org/10.1017/jsl.2019.22.

Full text

Abstract:

AbstractOur concern is the completeness problem for spi-logics, that is, sets of implications between strictly positive formulas built from propositional variables, conjunction and modal diamond operators. Originated in logic, algebra and computer science, spi-logics have two natural semantics: meet-semilattices with monotone operators providing Birkhoff-style calculi and first-order relational structures (aka Kripke frames) often used as the intended structures in applications. Here we lay foundations for a completeness theory that aims to answer the question whether the two semantics define the same consequence relations for a given spi-logic.

APA, Harvard, Vancouver, ISO, and other styles

39

Harjula, Matti, Jarmo Malinen, and Antti Rasila. "STACK with state." MSOR Connections 15, no. 2 (January 26, 2017): 60. http://dx.doi.org/10.21100/msor.v15i2.408.

Full text

Abstract:

The question model of STACK provides an easy way for building automatically assessable questions with mathematical content, but it requires that the questions and their assessment logic depend only on the current input, given by the student at a single instant. However, the present STACK question model already has just the right form to be extended with state variables that would remove this limitation. In this article, we report our recent work on the state-variable extension for STACK, and we also discuss combining the use of state variables with our previous work on conditional output processing. As an outcome, we propose an expansion to the STACK question model, allowing the questions to act as state machines instead of pure functions of a single input event from the studentWe present a model question using the state variable extension of STACK that demonstrates some of the new possibilities that open up for the question author. This question is based on a finite state machine in its assessment logic, and it demonstrates aspects of strategic planning to solve problems of recursive nature. The model question also demonstrates how the state machine can interpret the solution path taken by the student, so as to dynamically modify the question behaviour and progress by, e.g., asking additional questions relevant to the path. We further explore the future possibilities from the point of view of learning strategic competencies in mathematics (Kilpatrick et al., 2001; Rasila et al., 2015).

APA, Harvard, Vancouver, ISO, and other styles

40

Shcherbyna, Olena. "ON THE QUESTION OF LOGICAL ANALYSIS OF ARGUMENTATION IN LEGAL DISCOURSE." Bulletin of Taras Shevchenko National University of Kyiv. Philosophy, no. 6 (2022): 59–62. http://dx.doi.org/10.17721/2523-4064.2022/6-11/13.

Full text

Abstract:

The article highlights the main problems that arise during the logical analysis of argumentation in legal discourse. Based on the author's approach to understanding the logical analysis of legal argumentation, the possibilities of overcoming them are proposed. According to the author, in the process of conducting a logical analysis of argumentation in legal discourse, the following interrelated problems arise: the first is a problem associated with an ambiguous understanding of the meaning of the word "logic" when it is used in research on legal argumentation (logic as a science or a certain logical theory, logic as a model, formal or informal logic); the second is a problem related to the existence of different interpretations of the concept of "logical analysis", as a result of which there is uncertainty in the use of methods and means of conducting such an analysis. The following possible steps to overcome these problems are proposed: firstly, in research on legal argumentation, when conducting a logical analysis of argumentation in legal discourse the meaning of the word "logic" should be noted (logic as a science or a certain logical theory, logic as a model, formal or informal logic), used in this context; secondly, in the process of such an analysis, clearly define the meaning of the used concepts "analysis", and "model"; thirdly, to proceed from the fact that taking into account that formal and informal elements are connected in legal thinking, the logical analysis of legal argumentation can be understood as the application of methods, techniques, means of all logical knowledge in solving its problems.

APA, Harvard, Vancouver, ISO, and other styles

41

CARNIELLI, WALTER, MARCELO E. CONIGLIO, RODRIGO PODIACKI, and TARCÍSIO RODRIGUES. "ON THE WAY TO A WIDER MODEL THEORY: COMPLETENESS THEOREMS FOR FIRST-ORDER LOGICS OF FORMAL INCONSISTENCY." Review of Symbolic Logic 7, no. 3 (June 3, 2014): 548–78. http://dx.doi.org/10.1017/s1755020314000148.

Full text

Abstract:

AbstractThis paper investigates the question of characterizing first-orderLFIs (logics of formal inconsistency) by means of two-valued semantics.LFIs are powerful paraconsistent logics that encode classical logic and permit a finer distinction between contradictions and inconsistencies, with a deep involvement in philosophical and foundational questions. Although focused on just one particular case, namely, the quantified logicQmbC, the method proposed here is completely general for this kind of logics, and can be easily extended to a large family of quantified paraconsistent logics, supplying a sound and complete semantical interpretation for such logics. However, certain subtleties involving term substitution and replacement, that are hidden in classical structures, have to be taken into account when one ventures into the realm of nonclassical reasoning. This paper shows how such difficulties can be overcome, and offers detailed proofs showing that a smooth treatment of semantical characterization can be given to all such logics. Although the paper is well-endowed in technical details and results, it has a significant philosophical aside: it shows how slight extensions of classical methods can be used to construct the basic model theory of logics that are weaker than traditional logic due to the absence of certain rules present in classical logic. Several such logics, however, as in the case of theLFIs treated here, are notorious for their wealth of models precisely because they do not make indiscriminate use of certain rules; these models thus require new methods. In the case of this paper, by just appealing to a refined version of the Principle of Explosion, or Pseudo-Scotus, some new constructions and crafty solutions to certain nonobvious subtleties are proposed. The result is that a richer extension of model theory can be inaugurated, with interest not only for paraconsistency, but hopefully to other enlargements of traditional logic.

APA, Harvard, Vancouver, ISO, and other styles

42

GRÄDEL, ERICH, and WIED PAKUSA. "RANK LOGIC IS DEAD, LONG LIVE RANK LOGIC!" Journal of Symbolic Logic 84, no. 1 (March 2019): 54–87. http://dx.doi.org/10.1017/jsl.2018.33.

Full text

Abstract:

AbstractMotivated by the search for a logic for polynomial time, we study rank logic (FPR) which extends fixed-point logic with counting (FPC) by operators that determine the rank of matrices over finite fields. WhileFPRcan express most of the known queries that separateFPCfromPtime, almost nothing was known about the limitations of its expressive power.In our first main result we show that the extensions ofFPCby rank operators over different prime fields are incomparable. This solves an open question posed by Dawar and Holm and also implies that rank logic, in its original definition with a distinct rank operator for every field, fails to capture polynomial time. In particular we show that the variant of rank logic${\text{FPR}}^{\text{*}}$with an operator that uniformly expresses the matrix rank over finite fields is more expressive thanFPR.One important step in our proof is to consider solvability logicFPSwhich is the analogous extension ofFPCby quantifiers which express the solvability problem for linear equation systems over finite fields. Solvability logic can easily be embedded into rank logic, but it is open whether it is a strict fragment. In our second main result we give a partial answer to this question: in the absence of counting, rank operators are strictly more expressive than solvability quantifiers.

APA, Harvard, Vancouver, ISO, and other styles

43

Qiu, Li, Fumihito Ikeda, and Naoko Yamashita. "Development of Logic-Based Question Classification Methods to Measure the Ability to Ask Questions Essential for Setting Research Questions." Integrated Science Education Journal 5, no. 2 (May 31, 2024): 91–100. http://dx.doi.org/10.37251/isej.v5i2.1003.

Full text

Abstract:

Purpose of the study: Many learners experience difficulties in generating questions that lead to research questions. This study aimed to present perspectives on questions that inquire into the logic within each type of logical reasoning, propose a new question classification method based on these perspectives, verify its objectivity, and examine participants' logicality. Methodology: This study deductively developed perspectives and classification methods for questions based on the logical reasoning theory. To verify the question-classification method and examine participants' logicality, 1,164 Self-described questions from 24 graduate-level students were collected. These questions were classified by two raters using qualitative research software, followed by a statistical analysis. Descriptive and inferential statistics were used for the analysis. Main Findings: Based on the analysis of the question data, the degree of agreement on question classification between the two raters was high. Notably, there was exceptional concordance in categorizing questions asking about deductive reasoning, hypothetical reasoning, and specific questions. Additionally, the analysis of question characteristics revealed a predominant presence of questions asking about inductive reasoning and ambiguous questions. In contrast, there were fewer questions asking about deductive reasoning, hypothetical reasoning, and specific questions. Novelty/Originality of this study: This research adds a logical perspective to traditional question frameworks and develops objective question classification methods. It provides a framework to support the formation of questions that lead to research questions and a method to objectively assess the quality of learning question formation techniques, with significant implications for educational practices. This study is limited by few raters, few specific questions.

APA, Harvard, Vancouver, ISO, and other styles

44

Shestova, Evgeniya A. "Phenomenology of the “Logic of Question and Answer”." Voprosy Filosofii, no. 1 (2022): 148–58. http://dx.doi.org/10.21146/0042-8744-2022-1-148-158.

Full text

Abstract:

In this article I examine the reading as a communication, that takes place within the text space. The investigation is based on the conceptions of H.-G. Gadamer and M. Merleau-Ponty. I consider the reading as quasi-dialog without a real “dialog partner” and investigate, what produces an effect of request to the reader. I start with the examination of Gadamer’s “logic of question and answer”, and my proposition is to interepret “question” and “answer” as two aspects of sense, which are contained interwoven in every expression: the negative aspect and the positive one. Following the Merleau-Ponty’s interpretation of the language as gesticulation, I trace the function of question, or the negative aspect of sense, in the communication. The question marks the gap between the spoken word and something that is to speak, it points on the open possibilities of sense. In his latest works Merleau-Ponty re-interprets Husserls concept of “significative intention”: he accents the meaning of a tendency, of a void, that is to fulfill by the reader. The text conveys not the sense nor the signification, but the significative intention. It is the request addressed to the reader from the “author” or the “text” who is supposed to be a “dialog partner”. We propose to denominate it as “quasi-author”, which is an unavoidable structural part of every act of reading.

APA, Harvard, Vancouver, ISO, and other styles

45

Fear, Christopher. "The question-and-answer logic of historical context." History of the Human Sciences 26, no. 3 (June 21, 2013): 68–81. http://dx.doi.org/10.1177/0952695113491757.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Dika, Tarek R. "Logic: The Question of Truth (review)." MLN 125, no. 5 (2010): 1155–58. http://dx.doi.org/10.1353/mln.2010.0037.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Babbitt, Susan E. "Stories from the South: A Question of Logic." Hypatia 20, no. 3 (2005): 1–21. http://dx.doi.org/10.1353/hyp.2005.0094.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Smith, Steven G. "Bowl climbing: The logic of religious question rivalry." International Journal for Philosophy of Religion 36, no. 1 (August 1994): 27–43. http://dx.doi.org/10.1007/bf01314199.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Babbitt, Susan E. "Stories from the South: A Question of Logic." Hypatia: A Journal of Feminist Philosophy 20, no. 3 (July 2005): 1–21. http://dx.doi.org/10.2979/hyp.2005.20.3.1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Babbitt, Susan E. "Stories from the South: A Question of Logic." Hypatia 20, no. 3 (2005): 1–21. http://dx.doi.org/10.1111/j.1527-2001.2005.tb00484.x.

Full text

Abstract:

In this paper, I argue that stories about difference do not promote critical self and social understanding; rather, on the contrary, it is the way we understand ourselves that makes some stories relevantly different. I discuss the uncritical reception of a story about homosexuality in Cuba, urging attention to generalizations explaining judgments of importance. I suggest that some stories from the South will never be relevant to discussions about human flourishing until we critically examine ideas about freedom and democracy, and their role in national identity, explaining the significance we give, or not, to such stories.

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!