Welcome to the staging ground for new communities! Each proposal has a description in the "Descriptions" category and a body of questions and answers in "Incubator Q&A". You can ask questions (and get answers, we hope!) right away, and start new proposals.
Are you here to participate in a specific proposal? Click on the proposal tag (with the dark outline) to see only posts about that proposal and not all of the others that are in progress. Tags are at the bottom of each post.
Activity for Derek Elkinsâ€
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Comment | Post #290895 |
It is not the *theory* that the quote is asking to be decidable, only the determination whether a particular formula is or is not an axiom. Note, whether something is or is not an axiom is different from whether it is or is not a *theorem*. So Presburger Arithmetic is an example, but so is Peano Arit... (more) |
— | 8 months ago |
| Edit | Post #291505 | Initial revision | — | 8 months ago |
| Answer | — |
A: Is there a specification meta-language for logics? There are many depending on what your goals are. First, pretty much any foundational system will let you do this via encoding. It is a tedious but straightforward exercise to encode the syntax of (typical) logics and their proof theories into PA (Peano Arithmetic), say, or even PRA (Primitive Recu... (more) |
— | 8 months ago |