Non-classical logic | Logic in computer science | Modal logic
In logic, philosophy, and theoretical computer science, dynamic logic is an extension of modal logic capable of encoding properties of computer programs. A simple example of a statement in dynamic logic is which states that if the ground is currently dry and it rains, then afterwards the ground will be wet. The syntax of dynamic logic contains a language of propositions (like "the ground is dry") and a language of actions (like "it rains"). The core modal constructs are , which states that after performing action a the proposition p should hold, and , which states that after performing action a it is possible that p holds.The action language supports operations (doing one action followed by another), (doing one action or another), and iteration (doing one action zero or more times). The proposition language supports Boolean operations (and, or, and not). The action logic is expressive enough to encode programs. For an arbitrary program , precondition , and postcondition , the dynamic logic statement encodes the correctness of the program, making dynamic logic more general than Hoare logic. Beyond its use in formal verification of programs, dynamic logic has been applied to describe complex behaviors arising in linguistics, philosophy, AI, and other fields. (Wikipedia).
Modal logic formalization of chess
In this video I explain modal logic using the example of the legal configurations of a board game. Kripke semantic and Kripke frames are discussed. The relation to Temporal and Doxastic logics are motivated. Here's the formal logic text from the video: https://gist.github.com/Nikolaj-K/174
From playlist Logic
Bas Spitters: Modal Dependent Type Theory and the Cubical Model
The lecture was held within the framework of the Hausdorff Trimester Program: Types, Sets and Constructions. Abstract: In recent years we have seen several new models of dependent type theory extended with some form of modal necessity operator, including nominal type theory, guarded and c
From playlist Workshop: "Types, Homotopy, Type theory, and Verification"
Logic: The Structure of Reason
As a tool for characterizing rational thought, logic cuts across many philosophical disciplines and lies at the core of mathematics and computer science. Drawing on Aristotle’s Organon, Russell’s Principia Mathematica, and other central works, this program tracks the evolution of logic, be
From playlist Logic & Philosophy of Mathematics
What are Non-Classical logics?
Some of the general classes of non-classical logics I touch in this videos are linear logic, relevant logic, modal logic, many-valued logics, minimal logic, paraconsistent logics and so on and so forth. Let me know if I should dive deeping into a certain scene? https://en.wikipedia.org/wi
From playlist Programming
Logic for Programmers: Propositional Logic
Logic is the foundation of all computer programming. In this video you will learn about propositional logic. 🔗Homework: http://www.codingcommanders.com/logic.php 🎥Logic for Programmers Playlist: https://www.youtube.com/playlist?list=PLWKjhJtqVAbmqk3-E3MPFVoWMufdbR4qW 🔗Check out the Cod
From playlist Logic for Programmers
Discrete-Time Dynamical Systems
This video shows how discrete-time dynamical systems may be induced from continuous-time systems. https://www.eigensteve.com/
From playlist Data-Driven Dynamical Systems
Propositional Logic and the Algebra of Boole | MathFoundations273 | N J Wildberger
We give an overview of classical Propositional Logic, which is a branch of philosophy concerned with systematizing reason. This framework uses "atomic statements" called "propositions", and "relations", or "connectives", between them, prominently AND, OR, NOT, IMPLIES and EQUIVALENT, and t
From playlist Boole's Logic and Circuit Analysis
Replacing truth tables and Boolean equivalences | MathFoundations274 | N J Wildberger
While Propositional Logic is a branch of philosophy, concerned with systematizing reasoning using connectives such as AND, OR, NOT, IMPLIES and EQUIVALENT, the Algebra of Boole provides a mathematical framework for modelling some of this. With this approach we ignore the issue of the mean
From playlist Boole's Logic and Circuit Analysis
LambdaConf 2015 - Introduction to Intuitionistic Type Theory Vlad Patryshev
Traditionally, in Computer Science, sets are assumed to be the basis of a type theory, together with Boolean logic. In this version of type theory, we do not need sets or Boolean logic; intuitionism is enough ("no principle of excluded middle required"). The underlying math is Topos Theory
From playlist LambdaConf 2015
Sam Coogan, Georgia Tech Probabilistic guarantees for autonomous systems For complex autonomous systems subject to stochastic dynamics, providing absolute assurances of performance may not be possible. Instead, probabilistic guarantees that assure, for example, desirable performance with
From playlist Fall 2019 Kolchin Seminar in Differential Algebra
Can Metaphysics Discern God II? | Episode 1705 | Closer To Truth
Can metaphysics discern God? How to think about God rationally, logically, profoundly, critically? Have no illusion that metaphysics can find God, but can a kind of progress be made? Featuring interviews with Brian Leftow, John Hawthorne, Robert Spitzer, John Cottingham, and Timothy O'Conn
From playlist Big Questions About God - Closer To Truth - Core Topic
Marie Kerjean: Differential linear logic extended to differential operators
HYBRID EVENT Recorded during the meeting Linear Logic Winter School" the January 28, 2022 by the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent Find this video and other talks given by worldwide mathematicians on CIRM's Audiovisual
From playlist Logic and Foundations
Paola Cantù : Logic and Interaction:pragmatics and argumentation theory
HYBRID EVENT Recorded during the meeting "Logic and transdisciplinarity" the February 11, 2022 by the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent Find this video and other talks given by worldwide mathematicians on CIRM's Audiov
From playlist Logic and Foundations
Stanford CS224N NLP with Deep Learning | Winter 2021 | Lecture 18 - Future of NLP + Deep Learning
For more information about Stanford's Artificial Intelligence professional and graduate programs visit: https://stanford.io/3pXE6kq To learn more about this course visit: https://online.stanford.edu/courses/cs224n-natural-language-processing-deep-learning To follow along with the course
From playlist Stanford CS224N: Natural Language Processing with Deep Learning | Winter 2021
Damiano Mazza: Heterodox exponential modalities in linear logic
HYBRID EVENT Recorded during the meeting Linear Logic Winter School" the January 28, 2022 by the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent Find this video and other talks given by worldwide mathematicians on CIRM's Audiovisual
From playlist Logic and Foundations
Logic 3: Quantifiers (univ. & exist.), Proofs part 1 — Tutorial 3/4
In this four-part series we explore propositional logic, Karnaugh maps, implications and fallacies, predicate logic, existential and universal quantifiers and finally natural deduction. Become a member: https://youtube.com/Bisqwit/join My links: Twitter: https://twitter.com/RealBisqwit L
From playlist Logic Tutorial
Styling on the web has been moving fast, bringing rich features for container-based styles and layouts, managing color contrast, leveraging device vibrant colors, gradients, and new color spaces for mixing, orchestrating stylesheets, subgrid, inert, :has() selector, and much more. With ea
From playlist Web Design: CSS / SVG
This video explains the new Neural Game Engine GameGAN from researchers at NVIDIA! This paper uses Deep Learning to store Pacman inside of a learned world model such that you can play the game by sending actions to the generative neural network. This video will describe the problem and how
From playlist Generative Adversarial Networks