Recently it was shown that the system with two S5 operators and full propositional quantification is also recursively intertranslatable with second-order logic.
In this paper we give a simple embedding of T into Double S5 that extends to the case where both ... A SIMPLE EMBEDDING OF T INTO DOUBLE S5. 3. (5) t(∀pA) ...
The system obtained by adding full propositional quantification to S5 is known to be decidable, while that obtained by doing so for T is known to be ...
This note establishes that the map assigning [1][2] p to p provides a validity and satisfaction preserving translation between the T system and the double S5 ...
Citations of: A Simple Embedding of T into Double S · Steven Kuhn · Notre Dame Journal of Formal Logic 45 (1):13-18 (2004) ...
A simple embedding of T into double S5. S Kuhn. Notre Dame Journal of Formal Logic 45 (1), 13-18, 2004. 12, 2004. Modal logic. S Kuhn, EJ Craig. Routledge ...
A basic question in geometric topology is the embedding problem of manifolds: given two (smooth) manifolds M and N, can one find a smooth embedding of M into N?
The strong embedding conjecture states that every 2-connected graph has a closed 2-cell embedding in some surface, i.e. an embedding that each face is ...
Nov 15, 2023 · An embedding is a mapping of objects to vectors. Those objects may be real things or digital objects like images and files.
We consider the question of reducing the homeomorphism problem for pairs of topological spaces to the homeomorphism problem for single spaces.