P. Lorenzen. Ein dialogisches Konstruktivitatskriterium. In Infinitistic Methods, pages 193--200, Warszawa, 1961. PWN. Proceed. Symp. Foundations of Math.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....that similar results held for their model. What is interesting is that such similar results have been obtained by somewhat di erent routes. Hyland and Ong s approach is based on dialogue games and innocent strategies, in the tradition of Lorentzen s dialogue interpretations of logical proofs [Lor60, Lor61], and the work by Kleene and Gandy on the semantics of higher type recursion theory [Gan93] while our approach is closer to process semantics and the Geometry of Interaction [AJ94a, Mal93] Further work is needed to understand more fully the relationship between the two approaches. ....

P. Lorenzen. Ein dialogisches Konstruktivitatskriterium. In In nitistic Methods, pages 193-200, Warszawa, 1961. PWN. Proceed. Symp. Foundations of Math.

....of the dialogue. Yet, claims may, as will be shown, be accepted by the community 3 The changed assessment occurred after a change in management, which reinforces the point being made here. 4 A formal model of dialectical argumentation was also developed by Paul Lorenzen and his colleagues [47, 48] to provide a game theoretic semantics for intuitionistic logic. These models have since been applied, for example, to logics for quantum physics [57] 5 Recent reviews of argumentation in AI include [13, 66] which discuss theoretical aspects, and [10] which reviews applications. In addition, ....

P. Lorenzen. Ein dialogisches konstruktivitatskriterium. In Infinitistic Methods: Proceedings of the Symposium on the Foundations of Mathematics, Warsaw, 2-9 September

....former seeks to establish the truth of the formula under consideration, the latter to establish its falsity, and the heart of the semantics consists of rules for the debate between these two. The idea of using two party dialogs to explain the meanings of logical connectives goes back to Lorenzen [22], and the particular operations on games, which interpret the connectives in [4] go back to [3] In [5] I described a very similar semantics based on a type theoretic viewpoint. The intuition here is that a formula A represents a server capable of providing, to some user, elements of type ....

P. Lorenzen. Ein dialogisches Konstruktivitatskriterium. In Infinitistic Methods [20], pages 193--200.

....the distinction between the additive and the multiplicative versions of disjunction and conjunction simply disappears. Thus, classical logic and our variant of linear logic result from two special cases of one general semantical approach. In the end, some historical remarks. Apparently Lorenzen [7] was the first to introduce a game semantics, in the late 50 s. He suggested that the meaning of a proposition should be specified by establishing the rules of treating it in a debate (game) between a proponent who asserts the proposition and an opponent who denies it. Lorenzen s approach ....

P.Lorenzen, Ein dialogisches Konstruktivitatskriterium. In: Infinitistic Methods (PWN, Warsaw, 1959), pp.193-200.

....logic. They also observed, however, that history freeness does not work well in the presence of the additive connectives. One possible meaning for independence is the AbramskyJagadeesan notion of uniformity (without history freeness) Another possibility, a modification of an idea of Lorenzen [12], is that the server should never find itself expected to act in an atomic subgame A unless the client has previously had to act in a corresponding A . All these speculations need considerably more work in the direction of soundness (and if possible completeness) theorems. I have not (yet) ....

P. Lorenzen, Ein dialogisches Konstruktivitatskriterium, Infinitistic Methods, PWN, 1961, pp. 193--200.

....that similar results held for their model. What is interesting is that such similar results have been obtained by somewhat different routes. Hyland and Ong s approach is based on dialogue games and innocent strategies, in the tradition of Lorentzen s dialogue interpretations of logical proofs [Lor60, Lor61], and the work by Kleene and Gandy on the semantics of higher type recursion theory [Gan93] while our approach is closer to process semantics and the Geometry of Interaction [AJ94a, Mal93] Further work is needed to understand more fully the relationship between the two approaches. Independently, ....

P. Lorenzen. Ein dialogisches Konstruktivitatskriterium. In Infinitistic Methods, pages 193--200, Warszawa, 1961. PWN. Proceed. Symp. Foundations of Math.

....rich, expressive universe which can model a variety of programming languages very accurately. Semantics: an Overview Prehistory of Game Semantics The earliest precursor of game semantics is in the games based interpretations of logic studied by Lorenzen, Lorenz et al. [6, 10, 11]. Proofs are modelled as dialogues between two characters: verifier V and falsifier F. For example, consider #x.#y.x prime(y) Semantics: an Overview dialogue F tries to show the statement false by picking a value which renders the #y.x false. V responds by ....

P. Lorenzen. Ein dialogisches Konstruktivit atskriterium. In Infinitistic Methods, pages 193--200, Warszawa, 1961. PWN. Proceed. Symp. Foundations of Math.

No context found.

P. Lorenzen. Ein dialogisches Konstruktivitatskriterium. In Infinitistic Methods, pages 193--200, Warszawa, 1961. PWN. Proceed. Symp. Foundations of Math.

No context found.

Paul Lorenzen. Ein dialogisches Konstruktivitatskriterium. In InfinitisticMethods. Proceedings of the Symposium on Foundations of Mathematics (Warszawa 1959),pages 193--200. Pergamon Press, Oxford, 1961.

No context found.

Paul Lorenzen. Ein dialogisches Konstruktivitatskriterium. In InfinitisticMethods. Proceedings of the Symposium on Foundations of Mathematics (Warszawa 1959),pages 193--200. Pergamon Press, Oxford, 1961.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC