day40 - Dec 2, UCF (Charles E. 44 Encoding Use (p p) as...

Info iconThis preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon
10/4/11 Dec 2, © UCF (Charles E. 11 Diadic PIPC Diadic limits us to two variables PIPC means Partial Implicational Propositional Calculus, and limits us to implication as only connective Partial just means we get a fragment Problems Is fragment complete? Can F be derived by substitution and
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
10/4/11 Dec 2, © UCF (Charles E. 22 Living without Associativity Consider a two-stack model of a TM Could somehow use one variable for left stack and other for right Must find a way to encode a sequence as a composition of forms – that’s the key to this simulation
Background image of page 2
10/4/11 Dec 2, © UCF (Charles E. 33 Composition Encoding Consider (p & p), (p & (p ± p) ), No form is a substitution instance of any of the other, so they can’t be confused All are tautologies This is just X & Y
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
10/4/11
Background image of page 4
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Dec 2, UCF (Charles E. 44 Encoding Use (p p) as form of bottom of stack Use (p (p p)) as form for letter 0 Use (p (p (p p))) as form for 1 Etc. String 01 (reading top to bottom of stack) is ( ( (p & p) ( (p & p) ( (p & p) (p & p) ) ) ) 1 ( ( (p & p) ( (p p) ( (p & p) (p & p) ) ) ) 1 ( (p & p) 1 ( (p & p) ( (p & p) (p & p) ) ) ) ) ) 10/4/11 Dec 2, UCF (Charles E. 55 Encodings 10/4/11 Dec 2, UCF (Charles E. 66 Creating Terminal IDs 10/4/11 Dec 2, UCF (Charles E. 77 Reversing Print and Left 10/4/11 Dec 2, UCF (Charles E. 88 Reversing Right 10/4/11 Dec 2, UCF (Charles E. 99 The Rest of the Story Its in the paper Result is that word decision problem for membership in the theorems of a diadic pipc is undecidable...
View Full Document

Page1 / 9

day40 - Dec 2, UCF (Charles E. 44 Encoding Use (p p) as...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online