Results 251 to 260 of about 1,323,933 (296)
Some of the next articles are maybe not open access.
Synthese, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Studia Logica, 2012
The author develops a modal logic with the modalities ``always necessary'' and ``sometimes necessary'', and dual modalities for possibility. He gives a Hilbert-style axiomatization, and an adequate semantics via Kripke frames with arbitrary families of accessibility relations. This logic has the finite model property and is, hence, decidable.
openaire +2 more sources
The author develops a modal logic with the modalities ``always necessary'' and ``sometimes necessary'', and dual modalities for possibility. He gives a Hilbert-style axiomatization, and an adequate semantics via Kripke frames with arbitrary families of accessibility relations. This logic has the finite model property and is, hence, decidable.
openaire +2 more sources
2009
The findings of the present study of selected modals and quasi-modals in matching corpora of Australian, New Zealand, British and American English reinforce those of diachronic investigations attesting to the rising popularity of the quasi-modals and declining fortunes of the modals in recent decades.
openaire +1 more source
The findings of the present study of selected modals and quasi-modals in matching corpora of Australian, New Zealand, British and American English reinforce those of diachronic investigations attesting to the rising popularity of the quasi-modals and declining fortunes of the modals in recent decades.
openaire +1 more source
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 1996
We add a binary operator ≥ to the logical language, with intended meaning of φ<ψ: ‘φ is at least as likely, probable, or trustworthy, as ψ’. The operator ≥ is interpreted on Kripke structures, making it possible to define the standard necessity operator □ in terms of ≥.
openaire +2 more sources
We add a binary operator ≥ to the logical language, with intended meaning of φ<ψ: ‘φ is at least as likely, probable, or trustworthy, as ψ’. The operator ≥ is interpreted on Kripke structures, making it possible to define the standard necessity operator □ in terms of ≥.
openaire +2 more sources
Journal of Philosophy, 1986
AbstractIn the first part of this chapter, I sketch out three grades of modal realism. After developing modal realism, I examine David Lewis's modal theory. I argue that Lewis's theory satisfies none of the grades of modal realism, and that it is really a case of modal reductionism. In particular, I demonstrate that Counterpart Theory is a rejection of
openaire +1 more source
AbstractIn the first part of this chapter, I sketch out three grades of modal realism. After developing modal realism, I examine David Lewis's modal theory. I argue that Lewis's theory satisfies none of the grades of modal realism, and that it is really a case of modal reductionism. In particular, I demonstrate that Counterpart Theory is a rejection of
openaire +1 more source
An organic electrochemical transistor for multi-modal sensing, memory and processing
Nature Electronics, 2023, , Tao Li
exaly
Mechanisms controlling pancreatic islet cell function in insulin secretion
Nature Reviews Molecular Cell Biology, 2021Jonathan Campbell, Christopher B Newgard
exaly
A multi-modal pre-training transformer for universal transfer learning in metal–organic frameworks
Nature Machine Intelligence, 2023Yeonghun Kang, Hyunsoo Park, Berend Smit
exaly
The tumour microenvironment in pancreatic cancer — clinical challenges and opportunities
Nature Reviews Clinical Oncology, 2020Won Jin Ho +2 more
exaly