Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Interactive logic : selected papers from the 7th Augustus de Morgan Workshop, London / / edited by Johan Van Benthem, Dov Gabbay, Benedikt Lowe
| Interactive logic : selected papers from the 7th Augustus de Morgan Workshop, London / / edited by Johan Van Benthem, Dov Gabbay, Benedikt Lowe |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Amsterdam, : Amsterdam University Press, c2007 |
| Descrizione fisica | 1 online resource (363 p.) |
| Disciplina | 519.3 |
| Altri autori (Persone) |
BenthemJ. F. A. K. van <1949->
LoweBenedikt GabbayDov M. <1945-> |
| Collana | Texts in logic and games |
| Soggetto topico |
Game theory
Logic, Symbolic and mathematical |
| ISBN |
9789048501120
9048501121 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | dut |
| Nota di contenuto |
Table of Contents; Preface; Ch. 1: A Compositional Game Semantics for Multi-Agent Logics of Partial Information; Ch. 2: Quantificational Modal Operators and Their Semantics; Ch. 3: A Note on Kuhn's Theor em; Ch. 4: What Kind of Memory is Needed to Win Infinitary Muller Games?; Ch. 5: Logics of Imperfect Information: Why Sets of Assignments?; Ch. 6: Reasoning about Communication Graphs; Ch. 7: Epistemic Foundations for Backward Induction: An Overview; Ch. 8: Multitape Games; Ch. 9 : The Complexity of Schotland Yard; Ch. 10 : Approaches to Independence Friendly Modal Logic; Ch. 11: Team Logic
DEMO - A Demo of Epistemic Modelling |
| Record Nr. | UNINA-9910146420203321 |
| Amsterdam, : Amsterdam University Press, c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logic and the foundations of game and decision theory - LOFT 8 : 8th International Conference, Amsterdam, The Netherlands, July 3-5, 2008 ; revised selected papers / / Giacomo Bonanno, Benedikt Lowe, Wiebe van der Hoek (eds.)
| Logic and the foundations of game and decision theory - LOFT 8 : 8th International Conference, Amsterdam, The Netherlands, July 3-5, 2008 ; revised selected papers / / Giacomo Bonanno, Benedikt Lowe, Wiebe van der Hoek (eds.) |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, 2010 |
| Descrizione fisica | 1 online resource (XI, 207 p. 35 illus.) |
| Disciplina | 005.13 |
| Altri autori (Persone) |
BonannoGiacomo
LoweBenedikt HoekW. van der (Wiebe) |
| Collana | Lecture notes in artificial intelligence |
| Soggetto topico |
Game theory
Logic |
| ISBN |
1-280-38836-6
9786613566287 3-642-15164-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Infinite Coordination Games -- Conditioning by Minimizing Accessibility -- Correspondences in the Theory of Aggregation -- Logic and Data Exchange: Which Solutions Are “Good” Solutions? -- Preference Change Triggered by Belief Change: A Principled Approach -- A Runs-and-Systems Semantics for Logics of Announcements -- From Nash to Dependency Equilibria -- Bridges between Dynamic Doxastic and Doxastic Temporal Logics -- Multi-agent Belief Revision with Linked Preferences -- A Note on Assumption-Completeness in Modal Logic. |
| Record Nr. | UNINA-9910483480103321 |
| Berlin ; ; New York, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logic and theory of algorithms : 4th conference on computability in Europe, CIE 2008, Athens, Greece, June 15-20, 2008 : proceedings / / Arnold Beckmann, Costas Dimitracopoulos, Benedikt Lowe (eds.)
| Logic and theory of algorithms : 4th conference on computability in Europe, CIE 2008, Athens, Greece, June 15-20, 2008 : proceedings / / Arnold Beckmann, Costas Dimitracopoulos, Benedikt Lowe (eds.) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2008 |
| Descrizione fisica | 1 online resource (XIX, 596 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
BeckmannArnold
DimitracopoulosCostas LoweBenedikt |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Computable functions
Computational intelligence |
| ISBN | 3-540-69407-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Deterministic Graphical Games Revisited -- Program Schemes with Deep Pushdown Storage -- Herbrand Theorems and Skolemization for Prenex Fuzzy Logics -- Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL -- Pure Iteration and Periodicity -- Programming Experimental Procedures for Newtonian Kinematic Machines -- Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time -- A Summation Algorithm from 11th Century China -- Sequential Automatic Algebras -- The Role of Classical Computation in Measurement-Based Quantum Computation -- The Algebraic Counterpart of the Wagner Hierarchy -- Computing by Observing: A Brief Survey -- A Quantum Information-Theoretic Proof of the Relation between Horn’s Problem and the Littlewood-Richardson Coefficients -- Pell Equations and Weak Regularity Principles -- Computable Categoricity of Graphs with Finite Components -- P Automata: Membrane Systems as Acceptors -- On the Processing Power of Protozoa -- Computing Equilibria in Large Games We Play -- A Week-End Off: The First Extensive Number-Theoretical Computation on the ENIAC -- Phase Transitions for Weakly Increasing Sequences -- Succinct NP Proofs from an Extractability Assumption -- Describing the Wadge Hierarchy for the Alternation Free Fragment of ?-Calculus (I) -- Subrecursive Complexity of Identifying the Ramsey Structure of Posets -- Solving Simple Stochastic Games -- The Shrinking Property for NP and coNP -- On the Hardness of Truthful Online Auctions with Multidimensional Constraints -- Effective Dimensions and Relative Frequencies -- Reachability in Linear Dynamical Systems -- Hybrid Functional Interpretations -- The Algorithm Concept – Tool for Historiographic Interpretation or Red Herring? -- Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion -- A Simple P-Matrix Linear Complementarity Problem for Discounted Games -- Implementing Spi Calculus Using Nominal Techniques -- An Enhanced Theory of Infinite Time Register Machines -- Many Facets of Complexity in Logic -- On the Computational Power of Enhanced Mobile Membranes -- Recursion in Higher Types and Resource Bounded Turing Machines -- Computability and Complexity in Self-assembly -- Extraction in Coq: An Overview -- Joining to High Degrees -- Factoring Out Intuitionistic Theorems: Continuity Principles and the Uniform Continuity Theorem -- Interpreting Localized Computational Effects Using Operators of Higher Type -- Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants -- Updatable Timed Automata with Additive and Diagonal Constraints -- First-Order Model Checking Problems Parameterized by the Model -- Domain Theory and the Causal Structure of Space-Time -- Recursion on Nested Datatypes in Dependent Type Theory -- Perfect Local Computability and Computable Simulations -- Complete Determinacy and Subsystems of Second Order Arithmetic -- Internal Density Theorems for Hierarchies of Continuous Functionals -- Two-by-Two Substitution Systems and the Undecidability of the Domino Problem -- The Relative Consistency of the Axiom of Choice — Mechanized Using Isabelle/ZF -- Upper Semilattices in Many-One Degrees -- Union of Reducibility Candidates for Orthogonal Constructor Rewriting -- The Quantum Complexity of Markov Chain Monte Carlo -- Topological Dynamics of 2D Cellular Automata -- Complexity of Aperiodicity for Topological Properties of Regular ?-Languages -- ?-Degree Spectra -- Cupping Classes of Enumeration Degrees -- Principal Typings for Explicit Substitutions Calculi -- How We Think of Computing Today. |
| Altri titoli varianti | CIE 2008 |
| Record Nr. | UNINA-9910483705003321 |
| Berlin, : Springer, 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
New computational paradigms : first conference on computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005 : proceedings / / S. Barry Cooper, Benedikt Lowe, Leen Torenvliet (eds.)
| New computational paradigms : first conference on computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005 : proceedings / / S. Barry Cooper, Benedikt Lowe, Leen Torenvliet (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2005 |
| Descrizione fisica | 1 online resource (XVIII, 578 p.) |
| Disciplina | 511.3/52 |
| Altri autori (Persone) |
CooperS. B (S. Barry)
LoweBenedikt TorenvlietLeen |
| Collana | Lecture notes in computer science |
| Soggetto topico | Computable functions |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent It -- Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees -- The Fan Theorem and Uniform Continuity -- Continuous Semantics for Strong Normalization -- A Thread Algebra with Multi-level Strategic Interleaving -- Membrane Computing — Current Results and Future Problems -- How to Compare the Power of Computational Models -- Recombinant DNA ,Gene Splicing as Generative Devices of Formal Languages -- Quantum Computing -- Symbol Grounding in Connectionist and Adaptive Agent Models -- The Complexity of Inductive Definability -- A Logical Approach to Abstract Algebra -- Schnorr Dimension -- Abstract Geometrical Computation: Turing-Computing Ability and Undecidability -- Computability in Computational Geometry -- Shrad: A Language for Sequential Real Number Computation -- Borel Ranks and Wadge Degrees of Context Free ?-Languages -- Fewer Epistemological Challenges for Connectionism -- An Algebraic View on Exact Learning from Queries -- The Church-Turing Thesis: Breaking the Myth -- Robust Simulations of Turing Machines with Analytic Maps and Flows -- Infinitary Computability with Infinite Time Turing Machines -- Combinatorial Models of Gene Assembly -- Symmetric Enumeration Reducibility -- Computability-Theoretic and Proof-Theoretic Aspects of Vaughtian Model Theory -- Finite Trees as Ordinals -- On the Problems of Definability in the Enumeration Degrees -- Computing a Model of Set Theory -- Proof Mining in Functional Analysis -- Towards Computability of Higher Type Continuous Data -- The Power of Mobility: Four Membranes Suffice -- The Small Grzegorczyk Classes and the Typed ?-Calculus -- The Flow of Data and the Complexity of Algorithms -- On a Question of Sacks — A Partial Solution on the Positive Side -- The Low Splitting Theorem in the Difference Hierarchy -- Geometric Software: Robustness Issues and Model of Computation -- The Dimension of a Point: Computability Meets Fractal Geometry -- Accepting Networks of Splicing Processors -- Hilbert’s Tenth Problem and Paradigms of Computation -- On Some Relations Between Approximation Problems and PCPs over the Real Numbers -- Correlation Dimension and the Quality of Forecasts Given by a Neural Network -- The Computational Complexity of One-Dimensional Sandpiles -- Categoricity in Restricted Classes -- Recursion and Complexity -- FM-Representability and Beyond -- Formalising Exact Arithmetic in Type Theory -- Complexity in Predicative Arithmetic -- Domain-Theoretic Formulation of Linear Boundary Value Problems -- Membrane Computing: Power, Efficiency, Applications -- The Analogue of Büchi’s Problem for Polynomials -- On the Turing Degrees of Divergence Bounded Computable Reals -- New Algorithmic Paradigms in Exponential Time Algorithms -- Some Reducibilities on Regular Sets -- Computability and Discrete Dynamical Systems -- Uniform Operators -- Minimal Pairs and Quasi-minimal Degrees for the Joint Spectra of Structures -- Presentations of K-Trivial Reals and Kolmogorov Complexity -- Presentations of Structures in Admissible Sets -- An Environment Aware P-System Model of Quorum Sensing -- Kripke Models, Distributive Lattices, and Medvedev Degrees -- Arthur-Merlin Games and the Problem of Isomorphism Testing -- Beyond the Super-Turing Snare: Analog Computation and Digital Virtuality -- A Network Model of Analogue Computation over Metric Algebras -- Computable Analysis -- The Transfinite Action of 1 Tape Turing Machines -- Complexity of Continuous Space Machine Operations -- Computable Analysis of a Non-homogeneous Boundary-Value Problem for the Korteweg-de Vries Equation -- Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. |
| Altri titoli varianti | CiE 2005 |
| Record Nr. | UNINA-9910483180403321 |
| Berlin ; ; New York, : Springer, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||