Titlebook: Logic, Language, Information, and Computation; 24th International W Juliette Kennedy,Ruy J.G.B. de Queiroz Conference proceedings 2017 Spri

Diluge

978-3-662-55385-5Springer-Verlag GmbH Germany 2017

祖?zhèn)髫敭a(chǎn)

不規(guī)則

Multi-type Display Calculus for Semi De Morgan Logic,We introduce a proper multi-type display calculus for semi De Morgan logic which is sound, complete, conservative, and enjoys cut-elimination and subformula property. Our proposal builds on an algebraic analysis of semi De Morgan algebras and applies the guidelines of the multi-type methodology in the design of display calculi.

PLE

Graph Turing Machines, ordinary Turing machines and cellular automata. In this extended abstract, we give bounds on the computational strength of functions that graph Turing machines can compute. We also begin the study of the relationship between the computational power of a graph Turing machine and structural properties of its underlying graph.

祖?zhèn)?/a>

谷類

Shift Registers Fool Finite Automata, in the sense of Allouche and Shallit. We show that this implies that the nondeterministic automatic complexity . is close to maximal: ., where . is the length of .. In contrast, Hyde has shown . for all sequences . of length ..

thrombus

命令變成大炮

Ringworm

信任