#Microsoft's viral paper about *correlations* between #AI use and #criticalThinking also has "impact" in the title (despite admitting "Our analysis does not establish #causation"). 
#Confidence in #GenAI predicted LESS critical thinking.
SELF-confidence predicted MORE critical thinking.
PREDICTED ≠ CAUSED
You can't challenge your mind enough! :)
In the logic game "Untangle" for the Amiga, the player has a number of dots in front of him, which are connected by lines and cross each other. The aim of the game is to untangle the lines by moving the dots so that no line intersects another. Version 1.2 offers 25 new levels - 200 in total:
Hey there, any #VoiceOver peeps know how to configure a #UniversalAudio Solo/Arrow interface to record my #VO in a #Logic session with a client directing me on a video call? I’ve tried all the videos and articles about routing and virtual channels in #Console but in a recent Meets call, Meets just hijacked my audio so it was really quiet in Logic. Don’t know what I’m doing wrong. If you could explain it like I’m a baby that would be awesome. Don’t wanna use Loopback.
#HomeRecording #Video
36th European Summer School in Logic, Language and Information
https://2025.esslli.eu/
Registration is now open for students!
Boosts are appreciated.
@tg9541 @bookstodon @philosophy
yes, agree in a way. but do not see a win in playing off those two against each other, as later (after their common work PM) their work developed rather independently in more or less complementary areas, sometimes overlapping in #PhilSci topics.
E.g., if one focusses in #philosophy first of all on questions of #ontology (of science), ANW's process ontology will be much more impressive than the duplicating entities of logical constructs in say 'logical atomism' (which imop is a late and needless sin of BR).
If, on the other hand, the main focus is #logic and logic related
#epistemology and/or #PhilMath, there is roughly anything deeper and more worth considering than say the theory of incomplete symbols; and perhaps no more careful and penetrating study than the ramified theory of types as developed from the circulus vitiosus argument, even when this theory was abandoned in the sequel for independent reasons.
I don't know why, but I really enjoy reading such books, I get nostalgic, and at the same time I always learn something new (OK, I guess I know why)
The #haskell road to #logic #math and #programming
https://dl.icdst.org/pdfs/files3/d886fabbfccb269dfd3e52dfd2d1040b.pdf
PS Check this one as well:
https://abuseofnotation.github.io/category-theory-illustrated/
@arstechnica
Use "reality based thinking" as a synonym for science.
Registration for the Midlands Graduate School (MGS) in the Foundations of Computing Science is now open!
Spaces are limited, so please register early to secure your place.
https://tinyurl.com/MGS-2025
I have just released the public webpage for the #Logic course I am teaching, starting this week, at #ANU : https://comp.anu.edu.au/courses/comp2620/news/2025/02/17/welcome/ . At a time where too much is behind an LMS paywall, I hope the slides and tutorial exercises introducing logic help some people get to grips with the subject, and also inspires more academics to make their teaching materials publicly available.
Hello World!
I'm a Prof. of #ComputerScience at VRAIN/UPV (València, Spain), mainly working on (explainable, symbolic) artificial #intelligence #AI #XAI, (#probabilistic) #logic #programming, term #rewriting, #causality, #concurrency, programming #languages, #reversible computing, program #verification, and #debugging.
I plan to use this account mostly for scientific matters, but not only. I'm also quite interested in #photography, #sciencefiction, #travel, #movies, #series, etc, etc.
5 Women in Logic You Should Know
Let’s take a deep dive into some of the most notable women who have contributed to the field of logic.
By Vanja Subotic
Are you a student or a parent of a child 8-18 years old who’s interested in learning to code? Fiero Code is a self-guided online coding learning platform offered through the @thousandoakslibrary. Learn more at https://www.tolibrary.org/virtual-library/fiero-code
Flip Flops Make Great Soft Switches - Mechanical switches are pretty easy to understand—the contacts touch, the current ... - https://hackaday.com/2025/02/10/flip-flops-make-great-soft-switches/ #softswitch #flip-flop #logic #news
@QasimRashid if true this would mean all Corporations from the #USA would be basically forced to violate #AntiDiscrimination|Laws in most #EU member states, as this is mutually exclusive...
Can someone pitch that big #US #FastFood #Execs that they basically will be forced to leave a bigger market (#EU) because of it and let them punch the numbers?
(#Capitalism #logic cuz that's the only thing these suits understand!)
What's the density of tautologies in propositional formulas?
I know that, if we write down a propositional formula as a binary tree, if we allow \(k\) connectives, and if we consider only *alpha-congruent* propositional formulas (meaning: \(A\implies B\) is considered "the same" as \(X\implies Y\)) then there are:
\[ P_{n}(k) = k^{n}2^{2n+1}B_{n+1}C_{n} \]
different formulas, where \(B_{n+1}\) is the Bell number describing the possible choices of propositional variables, \(C_{n}\) is the Catalan number describing distinct binary trees, and we can negate each connective or leaf which gives us the factor \(2^{2n+1}\), and each internal node of a binary tree can be one of \(k\) possible connectives...usually \(k=4\). (This grows fast, like \(P_{n}(4)\sim n!30^{n}\) or so.)
There's a rough upper bound we can infer quickly. For example, if \(V_{n}(k)\) is the number of valid propositional formulas with exactly \(n\) connectives (and there are \(k\) possible primitive binary connectives to pick from), if \(U_{n}(k)\) is the number of unsatisfiable ("contradictory") propositional formulas in \(n\) binary connectives, then we have \(V_{n}(k)=U_{n}(k)\) since negating a valid formula makes it unsatisfiable (and negating an unsatisfiable formula makes it valid). This suggests that
\[ 2V_{n}(k)\leq P_{n}(k)\implies \frac{V_{n}(k)}{P_{n}(k)}\leq\frac{1}{2}\]
But this is rather coarse of an upper bound.
I know \(V_{0}(4)=0\) and \(V_{1}(4)=12\), but beyond that things just grow too quickly for me :(
A drawing from outside the #boston #museum #of #finearts #bofa #michaelpaulino #michaelpaulinostudios #3dprinting #siliconvalley #ibm #googlelabs #microsoft #michaelpaulinostudios #journalist #mrveryviral #deepseek #huggingface #perchance #chatgpt #llm #opensource #reason #logo #logic #nyc #graphicdesign #fiverr #github #coding #wordpress
A little thread on constructive mathematics and (tight) apartness relations in particular
If we weren't supposed to eat ALL THE SWEETS then The Universe wouldn't have made them so moreish.
Ergo.. diabetes and general tubiness is The Universe's will. And who am I to question that?
#Logic #PracticalPhilosophy
It is true that this is not a county-maintained road.
It is also not a road.
