GitHub - bitlaw-jp/the-constitution-of-japanYou signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert
Vulcan: A JavaScript Automated Proof System · Ryan Marcus
Mathematicians have been trying to figure out how to get computers to write proofs for a long time. One of the earliest (dating back to the 1960s) attempts to do so was a logical rule called resolution. I created Vulcan, an NPM package that implements a resolution-based automated proof system. Below is a in-browser demo I created with AngularJS and Browserify. You can use symbols A-Z as variables
éšã«ã‚‚è«–ç†çš„æ€è€ƒåŠ›ï¼å¾“æ¥ã®å®šèª¬è¦†ã™â€•å¤§é˜ªå¸‚立大 （時事通信） - Yahoo!ニュース
ã“ã‚Œã¾ã§æ€è€ƒã‚„推論を伴ã†ã€ŒèªçŸ¥èƒ½åŠ›ã€ãŒãªã„ã¨ã•ã‚Œã¦ããŸéšé¡žã«ã¤ã„ã¦ã€å¤§é˜ªå¸‚立大ç†å¦ç ”究科ã®å¹¸ç”°æ£å…¸æ•™æŽˆã‚‰ã®ã‚°ãƒ«ãƒ¼ãƒ—ãŒã€ç†±å¸¯éšã®ä¸€ç¨®ã¯è«–ç†çš„ãªæ€è€ƒåŠ›ã‚’æŒã¤ã“ã¨ã‚’実験ã§æ˜Žã‚‰ã‹ã«ã—ã€ã‚¹ã‚¤ã‚¹ã®ç”Ÿç‰©å¦å°‚門誌ã®ã‚ªãƒ³ãƒ©ã‚¤ãƒ³ç‰ˆã«3æ—¥ã€è«–文を掲載ã—ãŸã€‚ 幸田教授らã¯ã€ã‚«ãƒ¯ã‚¹ã‚ºãƒ¡ç§‘ã®ç†±å¸¯éšã€Œã‚¸ãƒ¥ãƒªãƒ‰ã‚¯ãƒãƒŸã‚¹ã€ã‚’使ã„ã€ã€ŒAãŒBより強ãã€BãŒCより強ã‘ã‚Œã°ã€Aã¯Cより強ã„ã€ã¨ã„ã†è«–ç†çš„æ€è€ƒãŒã§ãã‚‹ã‹èª¿ã¹ãŸã€‚ ジュリドクãƒãƒŸã‚¹ã¯å€‹ä½“è˜åˆ¥èƒ½åŠ›ãŒã‚ã‚Šã€å¼±ã„個体ã¯å¼·ã„個体ã«å¯¾ã—ã¦ã€Œé€ƒã’ã‚‹ã€ã€Œä½“を傾ã‘ã¦éœ‡ã‚ã›ã‚‹ã€ãªã©ã®åŠ£ä½è¡Œå‹•ã‚’示ã—ã€åŠ›é–¢ä¿‚ã®é †ä½ä»˜ã‘ã‚’ã—ã¦ã„ã‚‹ã“ã¨ãŒçŸ¥ã‚‰ã‚Œã¦ã„る。 実験ã§ã¯ã€ä½“é•·ãŒåŒç¨‹åº¦ã®ã‚ªã‚¹åŒå£«ã‚’戦ã‚ã›ã€å‹ã£ãŸæ–¹ã‚’Bã€è² ã‘ãŸæ–¹ã‚’Cã«ã‚°ãƒ«ãƒ¼ãƒ—分ã‘。次ã«Bã¨æˆ¦ã£ã¦AãŒå‹ã¤æ§˜åã‚’Cグループã®å€‹ä½“ã«è¦‹ã›ãŸå¾Œã€Cã¨Aをガラス越ã—ã«å¯¾é¢ã•ã›ãŸã¨ã“ã‚ã€Cã®12匹ã®ã†ã¡11匹ãŒåŠ£ä½è¡Œå‹•ã‚’見ã›ãŸã€‚ 幸田教授ã¯ã€Œéšã«
Open Logic Project
The Open Logic Project is a collection of teaching materials on mathematical logic aimed at a non-mathematical audience, intended for use in advanced logic courses as taught in many philosophy departments. It is open-source: you can download the LaTeX code. It is open: you’re free to change it whichever way you like, and share your changes. It is collaborative: a team of people is working on it, u
Design by contractã¨ãƒ›ãƒ¼ã‚¢è«–ç†
2. 自己紹介 ãƒãƒ³ãƒ‰ãƒ«ãƒãƒ¼ãƒ • æ£å¼ã«ã¯ã€Œkmt-t〠• ã¯ã¦ãªID : kmt-t2 • Twitter ID : kmt_t å±…ä½åœ° • 大阪ã«ã€Œå‡ºç¨¼ãŽã€ä¸ã§ã™ • é³¥å–ã«å¸°ã‚ã†ã¨ã—ã¦ãã®åº¦ã«é˜»æ¢ã•ã‚Œã¦ã„ã¾ã™â€¦orz 属性ãªã© • ã„ã‚ゆる「組ã¿è¾¼ã¿å±‹ã€ã§ã™ • 言語的ã«ã¯C/C++/C# • ミドルウェア(2D/3Dグラフィックスã€ãƒ•ã‚¡ã‚¤ãƒ«ã‚·ã‚¹ãƒ†ãƒ ãªã©) 1 4. Design by Contractã¨ã¯ 事å‰æ¡ä»¶ • ã‚る手続ããŒäº‹å‰ã«æº€ãŸã™ã¹ãæ¡ä»¶ 事後æ¡ä»¶ • ã‚る手続ããŒäº‹å¾Œã«æº€ãŸã™ã¹ãæ¡ä»¶ ä¸å¤‰æ¡ä»¶ • ã‚る手続ããŒå¸¸ã«æº€ãŸã™ã¹ãæ¡ä»¶ 以上ã®æ¡ä»¶ã‚’満ãŸã™ã“ã¨ã‚’プãƒã‚°ãƒ©ãƒ 上ã«è¨˜è¿°ã™ã‚‹ • C/C++ã§ã¯Assertã§è¨˜è¿°ã™ã‚‹ã“ã¨ãŒå¤šã„ • Eiffelã§ã¯è¨€èªžã§ã‚µãƒãƒ¼ãƒˆã—ã¦ã„るらã—ã„ (触ã£ãŸã“ã¨ã‚ã‚Šã¾ã›ã‚“) • ã¡ã‚‡ã£ã¨é ã„ã¨ã“ã‚ã§ã¯UMLã®ãƒ¦ãƒ¼ã‚¹ã‚±ãƒ¼ã‚¹è¨˜è¿°ã§ã‚‚åŒã˜ã‚ˆ
世界ã§ä¸€ç•ªãƒ”ュアãªè«–ç†åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžHilbert(ヒルベルト)ã‚’Rubyã§ä½œã£ãŸ. - Qiita
ã‚ã„ã•ã¤ ã“ã‚“ã«ã¡ã¯. 皆ã•ã‚“如何ãŠéŽã”ã—ã§ã—ょã†ã‹. 本日ã®æ—¥ä»˜ã‚’確èªè‡´ã—ã¾ã—ãŸã‚‰ã‚‚ã†2014年も残り一月åŠã¨æ”¹ã‚ã¦èªè˜ã•ã›ã‚‰ã‚Œé©šã„ã¦ã„ã¾ã™. ã“ã†ã‚‚時間ã®æµã‚ŒãŒæ—©ã„ã¨æ»ã¬ã®ã‚‚ã™ãã§ã™ã. 懸命ã«ç”Ÿãよã†ã¨æ€ã„ã¾ã™. ã•ã¦ä»Šå›žã¯Hilbertã¨ã„ã†è«–ç†åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã‚’作りã¾ã—ãŸ. （カジュアルã«ä½œã£ã¦ã‚‹ã‚ˆã†ã«è¦‹ãˆã¾ã™ãŒã€å‰²ã¨æœ¬æ°—ã§ã™.） ã¾ã ã¾ã ã‚„ã‚‹ã¹ã事ã¯æœ¬å½“ã«å¤šãã¦ã€é£´ã¡ã‚ƒã‚“ã‚ã’ã‚‹ã®ã§ã‚³ãƒŸãƒƒã‚¿ãƒ¼å¤§å‹Ÿé›†ã§ã™. （今ãªã‚‰ã‚«ãƒ³ãƒˆãƒªãƒ¼ãƒžãƒ¼ãƒ ã‚‚ã¤ã‘ã‚‹ã®ã§ãŠé¡˜ã„ã—ã¾ã™.） HP: http://hilbert-lang.org/ja/ Github: https://github.com/gogotanaka/Hilbert å‰åº§ 世界ã§ä¸€ç•ªãƒ”ュアã§è±Šã‹ãªãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªž ã“ã®è¨€èªžã§ä»®å®šã•ã‚Œã¦ã„ã‚‹ã®ã¯æ’真（トートãƒã‚¸ãƒ¼ï¼‰ã®ã¿ã§ã™. （厳密ã«è¨€ã†ã¨è‡ªç„¶æ¼”繹も仮定ã•ã‚Œã¦ã„ã¾ã™ãŒ.） 当åˆã€è‡ª
miniKanren.org
Twitter: @miniKanren    Github: @miniKanren    Google Group: miniKanren    IRC: irc://irc.libera.chat/minikanren Follow @miniKanren Workshop | Book | Online Course | Implementations | Projects | Upcoming Talks | Talks | Interviews | Tutorials | Theses | Papers | Screencasts | Weekly Hangouts | Podcasts | Blogs | Contact What is miniKanren? miniKanren is a family of Domain Specific Languages for lo
よã使ㆠCoq.Logic ã®å…¬ç† - ç°¡æ½”ãªQ
Coq.Logic ã«ã¯Coqã®é›†åˆè«–モデルã«ãŠã„ã¦æ£ã—ã„å…¬ç†ã‚„ã€ãれらã®é–“ã®é–¢ä¿‚ãŒè¨˜è¿°ã•ã‚Œã¦ã„る。 ã“ã“ã§ã¯ãã®ä¸€éƒ¨ã‚’å–り上ã’ã¦ã€æ„味を説明ã™ã‚‹ã€‚ å‰æçŸ¥è˜ å…¬ç†ã‚’仮定ã—ãªã„状態ã§ã¯ã€ Coqã®è«–ç†ã¯ç›´è¦³ä¸»ç¾©è«–ç†ã§ã‚る。 ã‚ã‚‹2ã¤ãŒã€Œç‰ã—ã„ã€ã¨ã„ã†å‘½é¡ŒãŒè¨¼æ˜Žã§ãã‚‹å ´åˆã¯é™å®šã•ã‚Œã‚‹ã€‚ 証明ã®æ–‡è„ˆ(Prop)ã«ãŠã‘る「Aã¾ãŸã¯Bã€ã¨ã€å€¤ã®æ–‡è„ˆ(Set/Type)ã«ãŠã‘る「Aã¾ãŸã¯Bã€ã¯åŒºåˆ¥ã•ã‚Œã‚‹ã€‚å‰è€…ã‹ã‚‰æƒ…å ±ã‚’å–り出ã™ã“ã¨ã¯ã§ããªã„よã†ã«ãªã£ã¦ã„ã‚‹(マッãƒãƒ³ã‚°ã®åž‹æ¤œæŸ»ã§å¼¾ã‹ã‚Œã‚‹ã€‚) 以下ã€å…¬ç†ã®èª¬æ˜Ž å¤å…¸è«–ç† (classical logic) å ´æ‰€: Coq.Logic.Classical å¤å…¸è«–ç†ã§è¨¼æ˜Žã§ãã‚‹ã“ã¨ã¯ã€ä¾‹ãˆã°ä»¥ä¸‹ã®å†…容ãŒã‚る。 排ä¸å¾‹ ( P or not P ) 二é‡å¦å®šé™¤åŽ»ãŠã‚ˆã³èƒŒç†æ³• ( if not not P, then P ) 決定性ã®å€¤ã®å–り出㗠(descr
文系ã®å¦å•ã«ãŠã‘ã‚‹ã€åŸºæœ¬ã®åŸºæœ¬ã®â€œãƒ¢ãƒŽã®è€ƒãˆæ–¹â€ã‚’æ•™ãˆã¦ãã ã•ã„。…
文系ã®å¦å•ã«ãŠã‘ã‚‹ã€åŸºæœ¬ã®åŸºæœ¬ã®â€œãƒ¢ãƒŽã®è€ƒãˆæ–¹â€ã‚’æ•™ãˆã¦ãã ã•ã„。 自然科å¦ã ã£ãŸã‚‰ã€ä»®èª¬ã‚’ç«‹ã¦ã€å®Ÿé¨“群ã¨çµ±åˆ¶ç¾¤ã«åˆ†ã‘ã¦å®Ÿé¨“ã™ã‚‹ã“ã¨ã§ã€å•é¡Œã®æ‰€åœ¨ã‚’切り分ã‘ã¦ã„ã£ãŸã‚Šã§ãã¾ã™ã€‚ ãã®éŽç¨‹ã§ã¯ã€ä»–ã®äººãŒè¿½è©¦ã—ã¦ã‚‚åŒã˜çµæžœãŒå‡ºã‚‹ã“ã¨ãŒå¤§äº‹ã§ã‚ã£ãŸã‚Šã—ã¾ã™ã‚ˆã？ ãã‚Œã¯ãªã‚“ã¨ãªãç†è§£ã§ãã¾ã™ï¼ ã§ã‚‚社会科å¦ã‚„人文科å¦ã ã¨ã©ã†ã§ã—ょã†ã‹ï¼Ÿ æ´å²çš„ãªäº‹æƒ…ã¯å®Ÿé¨“群ã¨çµ±åˆ¶ç¾¤ã«åˆ†ã‘ãŸã‚Šã§ãã¾ã›ã‚“ã—ã€è¿½è©¦ã‚‚ã§ãã¾ã›ã‚“。æ´å²å¦ã®äººã¯ã€ãã†ã„ã†çŠ¶æ³ã§ã€è‡ªåˆ†ã®å¦èª¬ã«ã©ã†ã‚„ã£ã¦èª¬å¾—力をæŒãŸã›ã¦ã„ã‚‹ã®ã§ã™ã‹ï¼Ÿ ã‚ã‚‹ã„ã¯ã€ãŸã ã®ç«¥è©±ã«è¦‹ãˆã¦å®Ÿã¯å½“時ã®æ”¿åºœã‚’批判ã—ã¦ã„ã‚‹æ–‡å¦ä½œå“ãŒã‚ã£ãŸã¨ã—ã¾ã™ã€‚ãã‚ŒãŒæ”¿åºœæ‰¹åˆ¤ã§ã‚ã‚‹ã¨ã„ã†èªã¿ãŒæ€ã„è¾¼ã¿ã§ãªã„ã“ã¨ã‚’ã€ã©ã†ã‚„ã£ã¦ä»–人ã«èª¬æ˜Žã—ãŸã‚‰ã„ã„ã®ã§ã—ょã†ã‹ï¼Ÿ 関連ã™ã‚‹æœ¬ã¨ã‹ã‚ã£ãŸã‚‰æ•™ãˆã¦ãã ã•ã„。 é«˜æ ¡ç”Ÿã‹å¦éƒ¨ç”Ÿå‘ã‘ãらã„ã®æœ¬ãªã‚‰ãŒã‚“ã°ã£ã¦èªã‚ã¾ã™ï¼
Haskell ã«ãŠã‘ã‚‹ä¾å˜åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¨è¨¼æ˜Žã®è¨˜è¿°ã‚’用ã„ãŸå®Ÿç”¨çš„ãªãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã£ã¦ä½•
スマートコン @mr_konn Haskell ã«ãŠã‘ã‚‹ä¾å˜åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã§ã¯ã€å¤§æŠµã®å ´åˆå®‰å…¨æ€§ã®"証明"ã¨ã—ã¦ä¾å˜åž‹ã‚’用ã„ã‚‹å ´åˆãŒå¤šã„ã‹ã‚‰ã€ã²ã¨ãŸã³è¨¼æ˜ŽãŒå‡ºæ¥ã¦ã—ã¾ãˆã°ã€ãã®è¨¼æ˜Žã«å¯¾å¿œã™ã‚‹å®Ÿè¡Œæ™‚計算ã¯ç„¡é§„ãªã‚“ã よãªã‚。type erasure ãªã‚‰ã¬ proof erasure ãŒå‡ºæ¥ã‚Œã°ã‚ˆã„ã®ã ㌠2014-02-23 17:10:29 スマートコン @mr_konn 帰ç´æ³•ã¯ O(n) 書ã‹ã‚‹ã—ã€äºŒé‡å¸°ç´æ³•ãªã‚‰ O(n^2) ã 。一回示ã›ãŸã‚‰ unsafeCoerce ã™ã‚Šã‚ƒã„ã„ã‹ã‚‚ã—ã‚Œãªã„ã‘ã©ã€ãã†ã„ã†ã®ã‚’自動的ã«ã‚„ã£ã¦ãれるã®ã‚’欲ã—ã„ 2014-02-23 17:12:45
Tic Tac Type: Dependent Types with Idris
Functional programming provides a fundamental basis for reasoning about our programs and building out principled abstractions. However, it is not enoug…
æ€è€ƒæ³• - 演繹法ã¨å¸°ç´æ³•
æ€è€ƒæ³•-演繹法ã¨å¸°ç´æ³• åº æ•°åƒå¹´ä»¥ä¸Šå‰ã‹ã‚‰ã€ç§ãŸã¡äººé–“ã¯ã€Œã‚ˆã‚Šæ£ã—ã„ç”ãˆã€ã‚’å°ŽããŸã‚ã«ã€Œã‚ˆã‚Šæ£ã—ã„考ãˆæ–¹ã€ã‚’模索ã—ã¦ãã¾ã—ãŸã€‚ ãã—ã¦ã€å“²å¦è€…ã€ç§‘å¦è€…ã€æŠ€è¡“者ã¨ã„ã£ãŸå¤šãã®äººã«åŸ¹ã‚ã‚ŒãŸæ€è€ƒæ³•ã¯èº«ã®å›žã‚Šã®å‡ºæ¥äº‹ã‚’è«–ç†çš„ã«è§£æ˜Žã™ã‚‹ã“ã¨ã‚’å¯èƒ½ã¨ã—ã€ç¾ä»£æ–‡æ˜Žã®ç¤Žã¨ãªã£ã¦ã„ã¾ã™ã€‚ ã“ã“ã§ã¯æ•°å¤šã®å…ˆäººãŒè€ƒãˆã€ç™ºå±•ã•ã›ã¦ããŸæ€è€ƒæ³•ã‚’ã€ãã®æ¬ 点をå«ã‚ã¦ç¨šæ‹™ãªãŒã‚‰ç§ãªã‚Šã«æ•´ç†ã—ã¦ç´¹ä»‹ã—ã¾ã™ã€‚ æ¬ ç‚¹ã‚’ç´¹ä»‹ã™ã‚‹ã®ã¯ã€ãれを知るã“ã¨ã«ã‚ˆã‚Šé–“é•ã£ãŸè¨¼æ˜Žã‚„è©å¼ã‚’見抜ãã“ã¨ãŒã§ãるよã†ã«ãªã‚‹ã‹ã‚‰ã§ã™ã€‚ 1.演繹法ã¨å¸°ç´æ³• æ€è€ƒæ³•ã®ä»£è¡¨çš„ãªæ‰‹æ³•ã«æ¼”繹法ã¨å¸°ç´æ³•ãŒã‚ã‚Šã¾ã™ã€‚ 1.1.演繹法 演繹法ã¯ä¸€èˆ¬çš„原ç†ã‹ã‚‰è«–ç†çš„推論ã«ã‚ˆã‚Šçµè«–ã¨ã—ã¦å€‹ã€…ã®äº‹è±¡ã‚’å°Žã方法ã§ã™ã€‚ 代表的ãªæ‰‹æ³•ã«ã€å¤§å‰æ・å°å‰æ・çµè«–ã«ã‚ˆã‚‹ä¸‰æ®µè«–法ãŒã‚ã‚Šã¾ã™ã€‚ (例) 大å‰æ(一般的原ç†)「人間ã¯æ»ã¬ã€ å°å‰æ(事実ãªã©)「Aã¯äººé–“ã§ã‚る〠çµè«–(個々ã®
logict
logict Provides support for logic-based evaluation. Logic-based programming uses a technique known as backtracking to consider alternative values as solutions to logic statements, and is exemplified by languages such as Prolog and Datalog. Logic-based programming replaces explicit iteration and sequencing code with implicit functionality that internally "iterates" (via backtracking) over a set of
Logical snippets - Logic Matters
For a number of  years now, I’ve been a sporadic visitor to the very useful question-and-answer site, math.stackexchange.com — this is a student-orientated forum, not to be confused with the truly wonderful mathoverflow.net which is its research-level counterpart. OK, you can think of these visits as (hopefully) constructive procrastination on my part … Of course, many of the questions on the site
å½¢å¼æ‰‹æ³•å‹‰å¼·ä¼šç¬¬3回 device tokenã®ä»•æ§˜ã«ã¤ã„ã¦
å½¢å¼æ‰‹æ³•å‹‰å¼·ä¼šã§ä½¿ã£ãŸè³‡æ–™ã§ã™ã€‚ alloyã¨ã„ã†ãƒ„ールを使ã£ã¦ã„ã¾ã™ã€‚ alloy自体ã®ç´¹ä»‹ã¯åˆ¥ã®è³‡æ–™ã§èª¬æ˜Žã—ã¦ãŠã‚Šã€ ã“ã®è³‡æ–™ã§ã¯ä»¥ä¸‹ã®èªžã‚’説明無ã—ã«ä½¿ã£ã¦ã„ã¾ã™ ・ドット（çµåˆï¼‰ ・矢å°ï¼ˆç©ï¼‰ ・ãã®ä»–å„種シグãƒãƒãƒ£ ・alloyã®ç‰¹å¾´ï¼ˆå…¨ã¦ã¯é–¢ä¿‚ã€å…¨ã¦ã¯è«–ç†å¼ã€éžæ‰‹ç¶šã型言語ã§ã‚ã‚‹ã“ã¨ãªã©ï¼‰ ã“ã®ã‚ãŸã‚Šã®ç†è§£ã¯åŽŸå…¸ã«ã‚ãŸã‚‹ã®ãŒä¸€ç•ªæ‰‹ã£å–ã‚Šæ—©ã„ã§ã™ http://alloy.mit.edu/alloy/Read less
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
è«–ç†å¦ã®è€ƒãˆæ–¹ã§ã¤ãられãŸã€LLプãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªž obake - Qiita
bwin·必赢(ä¸å›½)唯一官方网站
Hilbert<ヒルベルト> - 世界ã§ä¸€ç•ªãƒ”ュアãªãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªž -
ウィトゲンシュタイン『論ç†å“²å¦è«–考ã€ã®ç¿»è¨³æ¯”較 - ビブレビï¼ã€€ãƒ–ãƒã‚°
Garrett's Links to Logical Constructed Languages
{{#tags}}- {{label}}
{{/tags}}