2018
DOI: 10.1007/s10992-018-9485-y
|View full text |Cite
|
Sign up to set email alerts
|

Implicit and Explicit Stances in Logic

Abstract: We identify a pervasive contrast between implicit and explicit stances in logical analysis and system design. Implicit systems change received meanings of logical constants and sometimes also the notion of consequence, while explicit systems conservatively extend classical systems with new vocabulary. We illustrate the contrast for intuitionistic and epistemic logic, then take it further to information dynamics, default reasoning, and other areas, to show its wide scope. This gives a working understanding of t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(10 citation statements)
references
References 37 publications
0
10
0
Order By: Relevance
“…[20] on algebraizability of logics), abstract recursion theory (compositionality as computability, [59]) and in particular, category theory, with Samson Abramsky's long-standing work as a prominent instance. Bits and pieces of relevant formal theory can also be found elsewhere, for instance in the extensive body of work on translations between logical systems, [24], [79], especially, when viewing giving a semantics as a form of translation between object and meta-language.…”
Section: The Minimal Machinery Of Compositionalitymentioning
confidence: 99%
See 2 more Smart Citations
“…[20] on algebraizability of logics), abstract recursion theory (compositionality as computability, [59]) and in particular, category theory, with Samson Abramsky's long-standing work as a prominent instance. Bits and pieces of relevant formal theory can also be found elsewhere, for instance in the extensive body of work on translations between logical systems, [24], [79], especially, when viewing giving a semantics as a form of translation between object and meta-language.…”
Section: The Minimal Machinery Of Compositionalitymentioning
confidence: 99%
“…By contrast, epistemic logic has explicit operators for knowledge of agents, but with these in place, the base logic can remain classical, based on the traditional notion of truth. A general study of the 'implicit' versus the 'explicit' methodology, and the many new questions to which this gives rise, is made in [79].…”
Section: Patterns and Issues In Language Changementioning
confidence: 99%
See 1 more Smart Citation
“…Combining this technique with some formalized BHK-interpretation of intuitionistic logic may allow us to turn intuitionistic logic and various intermediate logics into an epistemic logic of knowing how. The general method is to use a powerful epistemic language based on classical logic to unload the implicit epistemic content hidden behind the propositional language of propositional intuitionistic logic, foreseen by Hintikka and van Benthem viewing intuitionistic logic as an implicit epistemic logic [17,29]. For example, an intuitionistic logic formula α is first turned into a knowhow formula Khα in our setting; then depending on the structure of α and the BHK-interpretation, we can further decode α by reducing its complexity within the logical language, e.g., Kh(α ∨ β) can be decomposed to (Khα ∨ Khβ), where the connectives outside the scope of Kh are classical.…”
Section: Introductionmentioning
confidence: 99%
“…They do so by extending the language of propositional logic with a binary modality defined in terms of being the supremum of two states. First proposed in 1996, MILs have been around for some time, yet not much is known: (van Benthem 2017(van Benthem , 2019 pose two central open problems, namely (1) axiomatizing the two basic MILs of suprema on preorders and posets, respectively, and (2) proving (un)decidability. The main results of the first part of this paper are solving these two problems: (1) by providing an axiomatization [with a completeness proof entailing the two logics to be the same], and (2) by proving decidability.…”
mentioning
confidence: 99%