Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Jesse Hughes"'
Publikováno v:
Diverse Pedagogical Approaches to Experiential Learning, Volume II ISBN: 9783030836870
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8feb032d8ce438ecf3d729d8722b379a
https://doi.org/10.1007/978-3-030-83688-7_8
https://doi.org/10.1007/978-3-030-83688-7_8
Autor:
Jesse Hughes
Publikováno v:
Synthese. 168:179-199
Because much of the recent philosophical interest in functions has been motivated by their application in biology and other sciences, most of the ensuing discussions have focused on functional explanations to the neglect of the practical role of func
Autor:
Lambèr M. M. Royakkers, Jesse Hughes
Publikováno v:
Studia Logica, 89(1), 59-79. Springer
This paper studies long-term norms concerning actions. In Meyer’s Propositional Deontic Logic (PD e L), only immediate duties can be expressed, however, often one has duties of longer durations such as: "Never do that", or "Do this someday". In thi
Publikováno v:
Synthese, 158(2), 207-231. Springer
Synthese, 158 (2)
Synthese, 158 (2)
There has been considerable work on practical reasoning in artificial intelligence and also in philosophy. Typically, such reasoning includes premises regarding means–end relations. A clear semantics for such relations is needed in order to evaluat
Publikováno v:
Journal of Logic, Language and Information, 15(1-2), 83-108. Springer
Propositional dynamic logic (PDL) provides a natural setting for semantics of means-end relations involving non-determinism, but such models do not include probabilistic features common to much practical reasoning involving means and ends. We alter t
Autor:
Jesse Hughes, Bart Jacobs
Publikováno v:
Theoretical Computer Science, 327, 1-2, pp. 71-108
Theoretical Computer Science, 327, 71-108
Theoretical Computer Science, 327(1-2), 71-108. Elsevier
CMCS
Theoretical Computer Science, 327, 71-108
Theoretical Computer Science, 327(1-2), 71-108. Elsevier
CMCS
A new approach to simulations is proposed within the theory of coalgebras by taking a notion of order on a functor as primitive. Such an order forms a basic building block for a “lax relation lifting”, or “relator” as used by other authors. S
Autor:
Jesse Hughes, Steve Awodey
Publikováno v:
Mathematical Structures in Computer Science. 13:233-258
We present the dual to Birkhoff's variety theorem in terms of predicates over the carrier of a cofree coalgebra (that is, in terms of ‘coequations’). We then discuss the dual to Birkhoff's completeness theorem, showing how closure under deductive
Autor:
Jesse Hughes, Bart Jacobs
Publikováno v:
CTCS
It is well-known that a factorization system on a category (with sufficient pullbacks) gives rise to a fibration. This paper characterizes the fibrations that arise in such a way, by making precise the logical structure that is given by factorization
Autor:
Jesse Hughes
Publikováno v:
CMCS
We consider the dual of Theorem 1 from [33], relating closure conditions on subcategories with projectivity classes for collections of discrete cocones. We extend these results by adding a new operator for closure under domains of epis and show that