Pith. sign in

REVIEW 2 cited by

A Local Resolution of the Problem of Time. VII. Constraint Closure

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1906.03641 v2 pith:3Y5UVD66 submitted 2019-06-09 gr-qc

Edward Anderson This is my paper · ORCID
classification gr-qc
keywords constraintclosurealgorithmproblemdiracrelationalismtemporaltime
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We now set up Constraint Closure in a manner consistent with Temporal and Configurational Relationalism. This requires modifying the Dirac Algorithm - which addresses the Constraint Closure Problem facet of the Problem of Time piecemeal - to the TRi-Dirac Algorithm. This is a member of the wider class of Dirac-type algorithms that enjoys the property of being Temporal Relationalism implementing (TRi). Constraint algebraic structures ensue. We include examples of types of constraint, outcomes of the Dirac Algorithm and different kinds of Constraint Closure Problems. Enough new Principles of Dynamics is required to support this venture that an Appendix on it is provided: differential Hamiltonians, anti-Routhians, and the brackets, state spaces and morphisms corresponding to these.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Problem of Time and Background Independence: classical version's higher Lie Theory

    gr-qc 2019-07 unverdicted novelty 7.0 of 10

    Extends classical Lie theory with Lie's Algorithm and a commuting pentagon invariance criterion to locally resolve the Problem of Time via background independence.

  2. Nambu variant of Local Resolution of Problem of Time and Background Independence

    gr-qc 2019-08 reject novelty 5.0 of 10

    The paper extends a local resolution of the Problem of Time to Nambu n-ary bracket formalism, introducing Nambu-Dirac and Nambu algorithms and a claimed uniqueness theorem for Nambu observables.

Pith tools