Results 61 to 70 of about 11,768 (185)
Theoria, EarlyView.Abstract This paper argues for the significance of Kaplan's logic LD in two ways: first, by looking at how logic got along before we had LD, and second, by using it to bring out the similarity between David Hume's thesis that one cannot deduce claims about the future on the basis of premises only about the past, and the so‐called "essentiality" of the ...
Gillian Russell
wiley +1 more source
Recurrence extraction and denotational semantics with recursive definitions [PDF]
, 2022 Norman Danner
openalex +1 more source
Winged horses, rascals and discourse referents
Theoria, EarlyView.Abstract This paper discusses some remarks Kaplan made in ‘Bob and Carol and Ted and Alice’ concerning empty names. I show how his objections to a particular view involving descriptions derived from Ramsification can be avoided by a nearby alternative framed in terms of discourse reference.
Andreas Stokke
wiley +1 more source
A proof-theoretic view on scheduling in concurrency [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 This paper elaborates on a new approach of the question of the proof-theoretic study of concurrent interaction called "proofs as schedules". Observing that proof theory is well suited to the description of confluent systems while concurrency has non ...
Emmanuel Beffara
doaj +1 more source
(Co‐)Reference All the Way Down: A Unified Theory of (Pro) Nominals in Ordinary English
Theoria, EarlyView.ABSTRACT This essay joins two themes, both arising from Kripke's inspiring ideas in the theory of reference. The first theme concerns reference in general. The second examines the notion of co‐reference and the role it plays in a unified theory of pronouns for natural language.
Jessica Pepp, Joseph Almog
wiley +1 more source
An algebraic basis for specifying and enforcing access control in security systems [PDF]
, 2000 Security services in a multi-user environment are often based on access control mechanisms. Static aspects of an access control policy can be formalised using abstract algebraic models.
Pahl, Claus
core
Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We investigate the possibility of a semantic account of the execution time (i.e. the number of beta-steps leading to the normal form, if any) for the shuffling calculus, an extension of Plotkin's call-by-value lambda-calculus.
Giulio Guerrieri
doaj +1 more source
Modular Denotational Semantics for Effects with Guarded Interaction Trees [PDF]
, 2023 Dan Frumin, Amin Timany, Lars Birkedal
openalex +1 more source
Language machines: Toward a linguistic anthropology of large language models
Journal of Linguistic Anthropology, Volume 36, Issue 1, May 2026.Abstract Large language models (LLMs) challenge long‐standing assumptions in linguistics and linguistic anthropology by generating human‐like language without relying on rule‐based structures. This introduction to the special issue Language Machines calls for renewed engagement with LLMs as socially embedded language technologies.
Siri Lamoureaux +2 more
wiley +1 more source
The Journal of Engineering, Volume 2026, Issue 1, January/December 2026.ABSTRACT Workload pressure, examination stress, family responsibilities, and a variety of other factors all contribute to an increase in stress in the body. Stress weakens the human mind and body by accelerating several health disorders. Therefore, the number of approaches for early projection of stress plays a vital role in the healthcare sector ...
Srabanti Maji +8 more
wiley +1 more source