Zobrazeno 1 - 10
of 50
pro vyhledávání: '"Icard, Thomas F."'
Ibeling et al. (2023). axiomatize increasingly expressive languages of causation and probability, and Mosse et al. (2024) show that reasoning (specifically the satisfiability problem) in each causal language is as difficult, from a computational comp
Externí odkaz:
http://arxiv.org/abs/2405.03069
Autor:
Moss, Lawrence S., Icard, Thomas F.
This paper obtains a completeness result for inequational reasoning with applicative terms without variables in a setting where the intended semantic models are the full structures, the full type hierarchies over preorders for the base types. The syn
Externí odkaz:
http://arxiv.org/abs/2202.08725
Autor:
Icard, Thomas F., Joosten, Joost J.
Publikováno v:
Notre Dame Journal of Formal Logic, 53 (2), 133-154, 2012
The provability logic of a theory T is the set of modal formulas, which under any arithmetical realization are provable in T . We slightly modify this notion by requiring the arithmetical realizations to come from a specified set $\Gamma$. We make an
Externí odkaz:
http://arxiv.org/abs/2006.10539
Publikováno v:
In Cognition November 2022 228
Publikováno v:
In International Journal of Approximate Reasoning May 2021 132:154-180
Autor:
Icard, Thomas F.1 (AUTHOR) icard@stanford.edu, Moss, Lawrence S.2 (AUTHOR)
Publikováno v:
Journal of Philosophical Logic. Jun2023, Vol. 52 Issue 3, p705-730. 26p.
Autor:
Icard, Thomas F.
Publikováno v:
Philosophy of Science, 2018 Jan 01. 85(1), 79-101.
Externí odkaz:
https://www.jstor.org/stable/26551910
Publikováno v:
In Mathematical Social Sciences January 2018 91:62-70
Publikováno v:
In Cognition April 2017 161:80-93