Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computer science --- Computers --- -Electronic data processing --- -Logic, Symbolic and mathematical --- -681.3*F0 --- 681.3*F4 --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Office practice --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- Congresses --- Computerwetenschap--?*F0 --- Mathematical logic and formal languages (Theory of computation) --- Automation --- 681.3*F4 Mathematical logic and formal languages (Theory of computation) --- Electronic data processing --- Logic, Symbolic and mathematical --- 681.3*F0 --- Logic [Symbolic and mathematical ]

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2016, held in Deerfield Beach, FL, USA in January 2016. The 27 revised full papers were carefully reviewed and selected from 46 submissions. The scope of the Symposium is broad and includes constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; parameterized complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logics; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple-agent system logics; logics of proof and justification; non-monotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; and other logics in computer science.

Mathematical Theory --- Mathematics --- Physical Sciences & Mathematics --- Computer science. --- Mathematical logic. --- Computer Science. --- Mathematical Logic and Formal Languages. --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Informatics --- Science --- Machine theory. --- Formal Languages and Automata Theory. --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2020, held in Deerfield Beach, FL, USA, in January 2020. The 17 revised full papers were carefully reviewed and selected from 30 submissions. The scope of the Symposium is broad and includes constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; parameterized complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logics; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple-agent system logics; logics of proof and justification; non-monotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; other logics in computer science.

Information theory. --- Communication theory --- Communication --- Cybernetics --- Mathematical logic. --- Artificial intelligence. --- Mathematical Logic and Foundations. --- Mathematical Logic and Formal Languages. --- Artificial Intelligence. --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Machine theory. --- Formal Languages and Automata Theory. --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The theory relating algebraic curves and Riemann surfaces exhibits the unity of mathematics: topology, complex analysis, algebra and geometry all interact in a deep way. This textbook offers an elementary introduction to this beautiful theory for an undergraduate audience. At the heart of the subject is the theory of elliptic functions and elliptic curves. A complex torus (or “donut”) is both an abelian group and a Riemann surface. It is obtained by identifying points on the complex plane. At the same time, it can be viewed as a complex algebraic curve, with addition of points given by a geometric “chord-and-tangent” method. This book carefully develops all of the tools necessary to make sense of this isomorphism. The exposition is kept as elementary as possible and frequently draws on familiar notions in calculus and algebra to motivate new concepts. Based on a capstone course given to senior undergraduates, this book is intended as a textbook for courses at this level and includes a large number of class-tested exercises. The prerequisites for using the book are familiarity with abstract algebra, calculus and analysis, as covered in standard undergraduate courses.

Algebraic geometry. --- Functions of complex variables. --- Global analysis (Mathematics). --- Manifolds (Mathematics). --- Algebraic Geometry. --- Functions of a Complex Variable. --- Global Analysis and Analysis on Manifolds. --- Corbes algebraiques --- Geometria algebraica --- Superfícies de Riemann --- Geometry, Differential --- Topology --- Analysis, Global (Mathematics) --- Differential topology --- Functions of complex variables --- Geometry, Algebraic --- Complex variables --- Elliptic functions --- Functions of real variables --- Algebraic geometry --- Geometry --- Riemann (Superfícies) --- Funcions --- Espais de Teichmüller --- Fórmula de traça de Selberg --- Geometria algèbrica --- Geometria --- Anàlisi p-àdica --- Cicles algebraics --- Espais algebraics --- Esquemes (Geometria algebraica) --- Esquemes de grups (Matemàtica) --- Geometria algebraica aritmètica --- Grups algebraics lineals --- Geometria analítica --- Geometria biracional --- Geometria enumerativa --- Geometria tropical --- Homologia --- Singularitats (Matemàtica) --- Superfícies algebraiques --- Teoria de mòduls --- Teoria de la intersecció --- Teoria de Hodge --- Varietats abelianes --- Varietats algebraiques --- Funcions abelianes --- Corbes algèbriques --- Corbes el·líptiques --- Corbes modulars --- Corbes quàrtiques

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2020, held in Deerfield Beach, FL, USA, in January 2020. The 17 revised full papers were carefully reviewed and selected from 30 submissions. The scope of the Symposium is broad and includes constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; parameterized complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logics; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple-agent system logics; logics of proof and justification; non-monotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; other logics in computer science.

Mathematical logic --- Artificial intelligence. Robotics. Simulation. Graphics --- wiskunde --- KI (kunstmatige intelligentie)