Results 41 to 50 of about 5,644 (162)
Barwise: Infinitary Logic and Admissible Sets
Bulletin of Symbolic Logic, 2004 §0. Introduction. In [16], Barwise described his graduate study at Stanford. He told of his interactions with Kreisel and Scott, and said how he chose Feferman as his advisor. He began working on admissible fragments of infinitary logic after reading and giving seminar talks on two Ph.D.
Keisler, H. Jerome, Knight, Julia F.
openaire +3 more sources
Expected value, to a point: Moral decision‐making under background uncertainty
Noûs, Volume 59, Issue 4, Page 1093-1125, December 2025.Abstract Expected value maximization gives plausible guidance for moral decision‐making under uncertainty in many situations. But it has unappetizing implications in ‘Pascalian’ situations involving tiny probabilities of extreme outcomes. This paper shows, first, that under realistic levels of ‘background uncertainty’ about sources of value independent
Christian Tarsney
wiley +1 more source
Relational semantics of linear logic and higher-order model-checking
, 2015 In this article, we develop a new and somewhat unexpected connection between higher-order model-checking and linear logic. Our starting point is the observation that once embedded in the relational semantics of linear logic, the Church encoding of any ...
C Grellois +4 more
core +2 more sources
Sequences suffice for pointfree uniform completions
Journal of the London Mathematical Society, Volume 112, Issue 2, August 2025.Abstract Completions of metric spaces are usually constructed using Cauchy sequences. However, this does not work for general uniform spaces, where Cauchy filters or nets must be used instead. The situation in pointfree topology is more straightforward: the correct completion of uniform locales can indeed be obtained as a quotient of a locale of Cauchy
Graham Manuell
wiley +1 more source
Weak compactness cardinals for strong logics and subtlety properties of the class of ordinals
Journal of the London Mathematical Society, Volume 112, Issue 1, July 2025.Abstract Motivated by recent work of Boney, Dimopoulos, Gitman, and Magidor, we characterize the existence of weak compactness cardinals for all abstract logics through combinatorial properties of the class of ordinals. This analysis is then used to show that, in contrast to the existence of strong compactness cardinals, the existence of weak ...
Philipp Lücke
wiley +1 more source
Automated Termination Proofs for Logic Programs by Term Rewriting
, 2008 There are two kinds of approaches for termination analysis of logic programs: "transformational" and "direct" ones. Direct approaches prove termination directly on the basis of the logic program. Transformational approaches transform a logic program into
Giesl, J. +3 more
core +2 more sources
Arithmetical pluralism and the objectivity of syntax
Noûs, Volume 59, Issue 2, Page 372-391, June 2025.Abstract Arithmetical pluralism is the view that there is not one true arithmetic but rather many apparently conflicting arithmetical theories, each true in its own language. While pluralism has recently attracted considerable interest, it has also faced significant criticism.
Lavinia Picollo, Daniel Waxman
wiley +1 more source
Computing with infinitary logic
Theoretical Computer Science, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abiteboul, Serge +2 more
openaire +1 more source
Similarity accounts of counterfactuals: A reality check1
Philosophy and Phenomenological Research, Volume 110, Issue 3, Page 887-915, May 2025.Abstract To an unusual extent, philosophers agree that counterfactuals have truth conditions involving the most similar possible worlds where their antecedents are true, in the style of the celebrated and path‐breaking Stalnaker/Lewis accounts. Roughly, these accounts say that the counterfactual if A were the case, C would be the case is true if and ...
Alan Hájek
wiley +1 more source
Infinitely Complex Machines [PDF]
, 2007 Infinite machines (IMs) can do supertasks. A supertask is an infinite series of operations done in some finite time. Whether or not our universe contains any IMs, they are worthy of study as upper bounds on finite machines.
Steinhart, Eric
core