Увійти

Готові списки джерел за темами / Labelled deductive system / Статті в журналах

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Labelled deductive system.

Статті в журналах з теми "Labelled deductive system"

Автор: Grafiati

Опубліковано: 11 березня 2023

Оновлено: 31 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-24 статей у журналах для дослідження на тему "Labelled deductive system".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

KEMPSON, RUTH, and DOV GABBAY. "Crossover: a unified view." Journal of Linguistics 34, no. 1 (1998): 73–124. http://dx.doi.org/10.1017/s0022226797006841.

Повний текст джерела

Анотація:

This paper informally outlines a Labelled Deductive System for on-line language processing. Interpretation of a string is modelled as a composite lexically driven process of type deduction over labelled premises forming locally discrete databases, with rules of database inference then dictating their mode of combination. The particular LDS methodology is illustrated by a unified account of the interaction of wh-dependency and anaphora resolution, the so-called ‘cross-over’ phenomenon, currently acknowledged to resist a unified explanation. The shift of perspective this analysis requires is tha

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Kolowska-Gawiejnowicz, Miroslawa. "A Labelled Deductive System for Relational Semantics of the Lambek Calculus." Mathematical Logic Quarterly 45, no. 1 (1999): 51–58. http://dx.doi.org/10.1002/malq.19990450105.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

READ, STEPHEN. "SEMANTIC POLLUTION AND SYNTACTIC PURITY." Review of Symbolic Logic 8, no. 4 (2015): 649–61. http://dx.doi.org/10.1017/s1755020315000210.

Повний текст джерела

Анотація:

AbstractLogical inferentialism claims that the meaning of the logical constants should be given, not model-theoretically, but by the rules of inference of a suitable calculus. It has been claimed that certain proof-theoretical systems, most particularly, labelled deductive systems for modal logic, are unsuitable, on the grounds that they are semantically polluted and suffer from an untoward intrusion of semantics into syntax. The charge is shown to be mistaken. It is argued on inferentialist grounds that labelled deductive systems are as syntactically pure as any formal system in which the rul

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Marin, Sonia, Marianela Morales, and Lutz Straßburger. "A fully labelled proof system for intuitionistic modal logics." Journal of Logic and Computation 31, no. 3 (2021): 998–1022. http://dx.doi.org/10.1093/logcom/exab020.

Повний текст джерела

Анотація:

Abstract Labelled proof theory has been famously successful for modal logics by mimicking their relational semantics within deductive systems. Simpson in particular designed a framework to study a variety of intuitionistic modal logics integrating a binary relation symbol in the syntax. In this paper, we present a labelled sequent system for intuitionistic modal logics such that there is not only one but two relation symbols appearing in sequents: one for the accessibility relation associated with the Kripke semantics for normal modal logics and one for the pre-order relation associated with t

Стилі APA, Harvard, Vancouver, ISO та ін.

5

NEGRI, SARA, and GIORGIO SBARDOLINI. "PROOF ANALYSIS FOR LEWIS COUNTERFACTUALS." Review of Symbolic Logic 9, no. 1 (2015): 44–75. http://dx.doi.org/10.1017/s1755020315000295.

Повний текст джерела

Анотація:

AbstractA deductive system for Lewis counterfactuals is presented, based directly on the influential generalisation of relational semantics through ternary similarity relations introduced by Lewis. This deductive system builds on a method of enriching the syntax of sequent calculus by labels for possible worlds. The resulting labelled sequent calculus is shown to be equivalent to the axiomatic system VC of Lewis. It is further shown to have the structural properties that are needed for an analytic proof system that supports root-first proof search. Completeness of the calculus is proved in a d

Стилі APA, Harvard, Vancouver, ISO та ін.

6

D'Agostino, Marcello, and Dov M. Gabbay. "A generalization of analytic deduction via labelled deductive systems. Part I: Basic substructural logics." Journal of Automated Reasoning 13, no. 2 (1994): 243–81. http://dx.doi.org/10.1007/bf00881958.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Rasga, J. "Fibring Labelled Deduction Systems." Journal of Logic and Computation 12, no. 3 (2002): 443–73. http://dx.doi.org/10.1093/logcom/12.3.443.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

KEMPSON, RUTH. "Ellipsis in a Labelled Deduction System." Logic Journal of IGPL 3, no. 2-3 (1995): 489–526. http://dx.doi.org/10.1093/jigpal/3.2-3.489.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

OEHRLE, DICK. "Some 3-Dimensional Systems of Labelled Deduction." Logic Journal of IGPL 3, no. 2-3 (1995): 429–48. http://dx.doi.org/10.1093/jigpal/3.2-3.429.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Walton, D. "Applying labelled deductive systems and multi-agent systems to source-based argumentation." Journal of Logic and Computation 9, no. 1 (1999): 63–80. http://dx.doi.org/10.1093/logcom/9.1.63.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Indrzejczak, Andrzej. "A Labelled Natural Deduction System for Linear Temporal Logic." Studia Logica 75, no. 3 (2003): 345–76. http://dx.doi.org/10.1023/b:stud.0000009565.98020.9b.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Fu, Jun, Jinzhao Wu, and Hongyan Tan. "A Deductive Approach towards Reasoning about Algebraic Transition Systems." Mathematical Problems in Engineering 2015 (2015): 1–12. http://dx.doi.org/10.1155/2015/607013.

Повний текст джерела

Анотація:

Algebraic transition systems are extended from labeled transition systems by allowing transitions labeled by algebraic equations for modeling more complex systems in detail. We present a deductive approach for specifying and verifying algebraic transition systems. We modify the standard dynamic logic by introducing algebraic equations into modalities. Algebraic transition systems are embedded in modalities of logic formulas which specify properties of algebraic transition systems. The semantics of modalities and formulas is defined with solutions of algebraic equations. A proof system for this

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Mohd Nasir, Muhammad Farhan, Wan Ainun Mior Othman, and Kok Bin Wong. "Labelled Natural Deduction for Public Announcement Logic with Common Knowledge." Mathematics 8, no. 4 (2020): 626. http://dx.doi.org/10.3390/math8040626.

Повний текст джерела

Анотація:

Public announcement logic is a logic that studies epistemic updates. In this paper, we propose a sound and complete labelled natural deduction system for public announcement logic with the common knowledge operator (PAC). The completeness of the proposed system is proved indirectly through a Hilbert calculus for PAC known to be complete and sound. We conclude with several discussions regarding the system including some problems of the system in attaining normalisation and subformula property.

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Więckowski, Bartosz. "Intuitionistic multi-agent subatomic natural deduction for belief and knowledge." Journal of Logic and Computation 31, no. 3 (2021): 704–70. http://dx.doi.org/10.1093/logcom/exab013.

Повний текст джерела

Анотація:

Abstract This paper proposes natural deduction systems for the representation of inferences in which several agents participate in deriving conclusions about what they believe or know, where belief and knowledge are understood in an intuitionistic sense. Multi-agent derivations in these systems may involve relatively complex belief (resp. knowledge) constructions which may include forms of nested, reciprocal, shared, distributed or universal belief/knowledge as well as attitudes de dicto/re/se. The systems consist of two main components: multi-agent belief bases which assign to each agent a su

Стилі APA, Harvard, Vancouver, ISO та ін.

15

MENGOZZI, STEFANO. "Virtual Segments: The Hexachordal System in the Late Middle Ages." Journal of Musicology 23, no. 3 (2006): 426–67. http://dx.doi.org/10.1525/jm.2006.23.3.426.

Повний текст джерела

Анотація:

ABSTRACT Music-theoretical writings from the 13th to the 15th centuries maintained a basic distinction between two types of major sixth, customarily labeled hexachordum and deductio (or proprietas). The term hexachordum, more frequently called tonus (or semitonus) cum diapente, designated the interval of a major of minor sixth, frequently expressed by pitch letters only (such as G-e and A-F) and discussed independently of Guidonian solmization. On the other hand, proprietas and deductio indicated a ““virtual segment”” (the set of six syllables ut-la) that could be employed for the purpose of s

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Мелехин, В. Б., and М. В. Хачумов. "Classification and structured description of objects of the problematic environment in the knowledge representation model of autonomous intelligent mobile systems." MORSKIE INTELLEKTUAL`NYE TEHNOLOGII)</msg>, no. 4(58) (December 2, 2022): 177–84. http://dx.doi.org/10.37220/mit.2022.58.4.040.

Повний текст джерела

Анотація:

В статье рассмотрена классификация образов и характеризующих их признаков, опираясь на которую построено два вида структурированного описания различных объектов и живых существ (субъектов), которые могут находиться в проблемной среде и использоваться автономной интеллектуальной мобильной системой в соответствии с ее функциональным назначением. Первый вид предложенного структурированного описания типовых элементов представления знаний автономных интеллектуальных мобильных систем определяется деревом, позволяющим организовать индуктивный вывод в процессе идентификации отдельных объектов и субъек

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Foster, Simon, Chung-Kil Hur, and Jim Woodcock. "Unifying Model Execution and Deductive Verification with Interaction Trees in Isabelle/HOL." ACM Transactions on Software Engineering and Methodology, November 6, 2024. http://dx.doi.org/10.1145/3702981.

Повний текст джерела

Анотація:

Model execution allows us to prototype and analyse software engineering models by stepping through their possible behaviours, using techniques like animation and simulation. On the other hand, deductive verification allows us to construct formal proofs demonstrating satisfaction of certain critical properties in support of high-assurance software engineering. To ensure coherent results between execution and proof, we need unifying semantics and automation. In this paper, we mechanise Interaction Trees (ITrees) in Isabelle/HOL to produce an execution and verification framework. ITrees are coind

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Bacci, Giorgio, Giovanni Bacci, Kim G. Larsen, and Radu Mardare. "A Complete Quantitative Deduction System for the Bisimilarity Distance on Markov Chains." Logical Methods in Computer Science Volume 14, Issue 4 (November 16, 2018). https://doi.org/10.23638/lmcs-14(4:15)2018.

Повний текст джерела

Анотація:

In this paper we propose a complete axiomatization of the bisimilarity distance of Desharnais et al. for the class of finite labelled Markov chains. Our axiomatization is given in the style of a quantitative extension of equational logic recently proposed by Mardare, Panangaden, and Plotkin (LICS 2016) that uses equality relations $t \equiv_\varepsilon s$ indexed by rationals, expressing that `$t$ is approximately equal to $s$ up to an error $\varepsilon$'. Notably, our quantitative deduction system extends in a natural way the equational system for probabilistic bisimilarity given by Stark an

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Braüner, Torben. "Analytic Non-Labelled Proof-Systems for Hybrid Logic: Overview and a couple of striking facts." Bulletin of the Section of Logic, January 7, 2022. http://dx.doi.org/10.18778/0138-0680.2022.02.

Повний текст джерела

Анотація:

This paper is about non-labelled proof-systems for hybrid logic, that is, proof-systems where arbitrary formulas can occur, not just satisfaction statements. We give an overview of such proof-systems, focusing on analytic systems: Natural deduction systems, Gentzen sequent systems and tableau systems. We point out major results and we discuss a couple of striking facts, in particular that non-labelled hybrid-logical natural deduction systems are analytic, but this is not proved in the usual way via step-by-step normalization of derivations.

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Slavnov, Sergey. "Making first order linear logic a generating grammar." Logical Methods in Computer Science Volume 19, Issue 4 (November 17, 2023). http://dx.doi.org/10.46298/lmcs-19(4:11)2023.

Повний текст джерела

Анотація:

It is known that different categorial grammars have surface representation in a fragment of first order multiplicative linear logic (MLL1). We show that the fragment of interest is equivalent to the recently introduced extended tensor type calculus (ETTC). ETTC is a calculus of specific typed terms, which represent tuples of strings, more precisely bipartite graphs decorated with strings. Types are derived from linear logic formulas, and rules correspond to concrete operations on these string-labeled graphs, so that they can be conveniently visualized. This provides the above mentioned fragmen

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Lange, Silvan, Nils Krüger, Maximilian Warm, et al. "Lost in translation: Unveiling medical students' untold errors of medical history documentation." Clinical Teacher, March 3, 2024. http://dx.doi.org/10.1111/tct.13749.

Повний текст джерела

Анотація:

AbstractObjectiveThe accurate documentation of a medical history interview is an important goal in medical education. As students' documentation of medical history interviews is mostly decentralised on the wards, a systematic assessment of documentation quality is missing. We therefore evaluated the extent of details missed in students' medical history reports in a standardised setting.MethodsIn this prospective, observational study, 123 of 380 students (32.4%) participated in an Objective Structured Clinical Examination (OSCE) regarding history taking and documentation. Based on the interview

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Das, Anupam, and Colin Riba. "A Functional (Monadic) Second-Order Theory of Infinite Trees." Logical Methods in Computer Science Volume 16, Issue 4 (October 23, 2020). https://doi.org/10.23638/lmcs-16(4:6)2020.

Повний текст джерела

Анотація:

This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite trees. MSO on infinite trees is a rich system, and its decidability (&quot;Rabin's Tree Theorem&quot;) is one of the most powerful known results concerning the decidability of logics. By a complete axiomatization we mean a complete deduction system with a polynomial-time recognizable set of axioms. By naive enumeration of formal derivations, this formally gives a proof of Rabin's Tree Theorem. The deduction system consists of the usual rules for second-order logic seen as two-sorted first-or

Стилі APA, Harvard, Vancouver, ISO та ін.

23

de Veras, Tiago M. L., Arthur F. Ramos, Ruy J. G. B. de Queiroz, and Anjolina G. de Oliveira. "Computational paths - a weak groupoid." Journal of Logic and Computation, November 24, 2023. http://dx.doi.org/10.1093/logcom/exad071.

Повний текст джерела

Анотація:

Abstract On the basis of a labelled deduction system (LND$_{ED-}$TRS), we demonstrate how to formalize the concept of computational paths (sequences of rewrites) as equalities between two terms of the same type. This has allowed us to carry out a formal counterpart to equality between paths which is dealt with in homotopy theory, but this time with an approach using the device of term-rewriting paths. Using such formal calculus dealing with paths, we construct the fundamental groupoid of a path-connected $ X $ type and we define the concept of isomorphism between types. Next, we show that the

Стилі APA, Harvard, Vancouver, ISO та ін.

24

McHugh, Sheena, Justin Presseau, Courtney T. Luecking, and Byron J. Powell. "Examining the complementarity between the ERIC compilation of implementation strategies and the behaviour change technique taxonomy: a qualitative analysis." Implementation Science 17, no. 1 (2022). http://dx.doi.org/10.1186/s13012-022-01227-2.

Повний текст джерела

Анотація:

Abstract Background Efforts to generate evidence for implementation strategies are frustrated by insufficient description. The Expert Recommendations for Implementing Change (ERIC) compilation names and defines implementation strategies; however, further work is needed to describe the actions involved. One potentially complementary taxonomy is the behaviour change techniques (BCT) taxonomy. We aimed to examine the extent and nature of the overlap between these taxonomies. Methods Definitions and descriptions of 73 strategies in the ERIC compilation were analysed. First, each description was de

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!