Results 41 to 50 of about 712,824 (175)

Investigations on Higher-Order Infinitary Logic [PDF]

open access: yes
Higher-order logic and infinitary logic are two extensions of first-order logic that allow greater expressivity. Both features have not been investigated together yet.
Hermant, Olivier   +2 more
core   +1 more source

Sequent systems for PLTL

open access: yesLietuvos Matematikos Rinkinys, 2013
We consider three sequent calculi for propositional linear temporal logic (PLTL) which allow us to formalize the properties of operator “always”.  The main new results presented in the paper are: (1) introduction of the calculus with looping axioms; (2 ...
Romas Alonderis   +1 more
doaj   +1 more source

Characterizing interpolation pairs in infinitary graded logics

open access: yes, 2003
In this paper the problem of interpolation for the family of countable infinitary graded modal logics is considered. It is well known that interpolation fails in general for these logics and it is then natural to ask for a semantical characterization ...
D'AGOSTINO, Giovanna
core   +1 more source

Collective Plural Identity

open access: yesPhilosophy and Phenomenological Research, EarlyView.
ABSTRACT I argue against a near‐universally accepted extensionality principle concerning the necessary and sufficient conditions for plural identity, that is, the relation of identity that holds between pluralities of things. The extensionality principle says that pluralities xx and yy are identical iff they are same‐membered (i.e., iff any z that is ...
Simon Thunder
wiley   +1 more source

An infinitary propositional probability logic

open access: yesArchive for Mathematical Logic, 2022
AbstractWe introduce a logic for a class of probabilistic Kripke structures that we call type structures, as they are inspired by Harsanyi type spaces. The latter structures are used in theoretical economics and game theory. A strong completeness theorem for an associated infinitary propositional logic with probabilistic operators was proved by Meier ...
openaire   +3 more sources

Infinitary hybrid logic and the Lindelöf property [PDF]

open access: yes, 2015
This short note is about hybrid logic with infinitary rules, interpreted in named models. It is shown that there is a rule K such that the property ‘entails K’ is not Lindelöf: if some collection of rules R entails K, then there is not always a countable
Renardel de Lavalette, Gerard; id_orcid
core   +2 more sources

Aggregation and the Structure of Value

open access: yesNoûs, Volume 60, Issue 3, Page 619-644, September 2026.
ABSTRACT Roughly, the view I call “Additivism” sums up value across time and people. Given some standard assumptions, I show that Additivism follows from two principles. The first says that how lives align in time cannot, in itself, matter. The second says, roughly, that a world cannot be better unless it is better within some period or another.
Weng Kin San
wiley   +1 more source

Non-Denumerable Infinitary Modal Logic

open access: yes, 2009
Segerberg established an analogue of the canonical model theorem in modal logic for infinitary modal logic. However, the logics studied by Segerberg and Goldblatt are based on denumerable sets of pairs ‹Γ, α› of sets Γ of well-formed formulae and well ...
Cresswell,Max, Cresswell, Max
core   +1 more source

On the theories classified by an étendue

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.
Abstract We give a model‐theoretic characterisation of the geometric theories classified by étendues—the ‘locally localic’ topoi. They are the theories where each model is determined, syntactically and semantically, by any witness of a fixed collection of formulae.
Joshua L. Wrigley
wiley   +1 more source

Kripke on Gödel Incompleteness

open access: yesTheoria, Volume 92, Issue 3, June 2026.
ABSTRACT This paper surveys six of Saul Kripke's highly creative ideas and results on Gödel incompleteness, from when he was an undergraduate to last publications. These include his extension of incompleteness from sentences to predicates, his model‐theoretic proof of incompleteness of arithmetic, his compelling analysis of incompleteness in terms of ...
Daniel Isaacson
wiley   +1 more source

Home - About - Disclaimer - Privacy