-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
2 changed files
with
2 additions
and
2 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
{"componentChunkName":"component---src-pages-ko-posts-ts","path":"/ko/posts/","result":{"data":{"allMarkdownPost":{"group":[{"fieldValue":"ko","nodes":[{"title":"프로그래머를 위한 논리학 - 0","date":"5 years ago","dateForSort":"2020-03-11T07:30:16.000Z","postPath":"/ko/post/logic-for-programmers-000/","draft":false,"parent":{"excerpt":"<h2 id=\"prologue\" style=\"position:relative;\">들어가며<a href=\"#prologue\" aria-label=\"prologue permalink\" class=\"anchor after\"><svg aria-hidden=\"true\" focusable=\"false\" height=\"16\" version=\"1.1\" viewBox=\"0 0 16 16\" width=\"16\"><path fill-rule=\"evenodd\" d=\"M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z\"></path></svg></a></h2>\n<p>개발자 생활을 하다보면 한 번쯤 듣게 되는 (혹은 보게 되는) 말이 있다. 바로</p>\n<blockquote>\n<p>좋은 개발자가 되려면 수학(혹은 논리학)을 배워야지!</p>\n</blockquote>\n<p>이다. 물론 필자가 이런 주장에 완전히 동의한다는 말은 아니다. 그러나 누군가 위 주장을 아래와 같이 조금 수정한다면, 필자는 언제 어디서든지 옹호할 생각이 있다.</p>"}},{"title":"프로그래머를 위한 논리학 - 1","date":"4 years ago","dateForSort":"2020-05-16T00:50:00.000Z","postPath":"/ko/post/logic-for-programmers-001/","draft":false,"parent":{"excerpt":"<h2 id=\"prologue\" style=\"position:relative;\">두번째 글을 열면서<a href=\"#prologue\" aria-label=\"prologue permalink\" class=\"anchor after\"><svg aria-hidden=\"true\" focusable=\"false\" height=\"16\" version=\"1.1\" viewBox=\"0 0 16 16\" width=\"16\"><path fill-rule=\"evenodd\" d=\"M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z\"></path></svg></a></h2>\n<p>이전 글에서 명제 논리를 위해 필요한 기본적인 정의들과 진리표를 이용한 논증의 건전함 증명에 대해서 알아보았다. 이 글에서는 진리표를 이용한 증명이 언제 어려워지는지(혹은 불가능…</p>"}},{"title":"블로그 제작기","date":"5 years ago","dateForSort":"2020-02-18T07:30:16.000Z","postPath":"/ko/post/trip-to-make-a-blog/","draft":false,"parent":{"excerpt":"<p>이 블로그를 <a href=\"https://reactjs.org/\">React</a>, <a href=\"https://www.typescriptlang.org/\">TypeScript</a>와 <a href=\"https://www.gatsbyjs.org\">Gatsby</a>, 그리고 <a href=\"https://pages.github.com\">GitHub Pages</a> 로 제작하기까지의 여정을 이야기해보려고 한다.\n어떤 프로그래밍 언어들과 어떤 서비스들을 거쳐왔는지, 각각을 어떤 장점이 있어서 선택했고, 어떤 단점으로 인해 포기하게 되었는지에…</p>"}},{"title":"프로그래머를 위한 논리학 - 2","date":"4 years ago","dateForSort":"2020-06-01T07:30:16.000Z","postPath":"/draft2/ko/post/logic-for-programmers-002/","draft":true,"parent":{"excerpt":"<h2 id=\"prologue\" style=\"position:relative;\">세번째 글을 열면서<a href=\"#prologue\" aria-label=\"prologue permalink\" class=\"anchor after\"><svg aria-hidden=\"true\" focusable=\"false\" height=\"16\" version=\"1.1\" viewBox=\"0 0 16 16\" width=\"16\"><path fill-rule=\"evenodd\" d=\"M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z\"></path></svg></a></h2>\n<p><a href=\"/ko/post/logic-for-programmers-001/\">지난 글</a>에서는 공리와 추론 규칙에 대해 알아보고, 그 중 '고전 자연 연역 체계'라고 불리는 공리와 추론 규칙의 모음에 대해 설명하고 사용해 보았다. 이번 글은 고전 자연 연역 체계를 …</p>"}}]}]},"site":{"siteMetadata":{"name":"Junyoung/\"Clare\" Jang","shortName":"J. Jang","siteUrl":"https://Ailrun.github.io","description":"Ailrun's Blog","author":"Junyoung/\"Clare\" Jang (@Ailrun)","locales":["ko_KR"],"themeColor":"#000000"}}},"pageContext":{}},"staticQueryHashes":[],"slicesMap":{}} | ||
{"componentChunkName":"component---src-pages-ko-posts-ts","path":"/ko/posts/","result":{"data":{"allMarkdownPost":{"group":[{"fieldValue":"ko","nodes":[{"title":"블로그 제작기","date":"5 years ago","dateForSort":"2020-02-18T07:30:16.000Z","postPath":"/ko/post/trip-to-make-a-blog/","draft":false,"parent":{"excerpt":"<p>이 블로그를 <a href=\"https://reactjs.org/\">React</a>, <a href=\"https://www.typescriptlang.org/\">TypeScript</a>와 <a href=\"https://www.gatsbyjs.org\">Gatsby</a>, 그리고 <a href=\"https://pages.github.com\">GitHub Pages</a> 로 제작하기까지의 여정을 이야기해보려고 한다.\n어떤 프로그래밍 언어들과 어떤 서비스들을 거쳐왔는지, 각각을 어떤 장점이 있어서 선택했고, 어떤 단점으로 인해 포기하게 되었는지에…</p>"}},{"title":"프로그래머를 위한 논리학 - 1","date":"4 years ago","dateForSort":"2020-05-16T00:50:00.000Z","postPath":"/ko/post/logic-for-programmers-001/","draft":false,"parent":{"excerpt":"<h2 id=\"prologue\" style=\"position:relative;\">두번째 글을 열면서<a href=\"#prologue\" aria-label=\"prologue permalink\" class=\"anchor after\"><svg aria-hidden=\"true\" focusable=\"false\" height=\"16\" version=\"1.1\" viewBox=\"0 0 16 16\" width=\"16\"><path fill-rule=\"evenodd\" d=\"M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z\"></path></svg></a></h2>\n<p>이전 글에서 명제 논리를 위해 필요한 기본적인 정의들과 진리표를 이용한 논증의 건전함 증명에 대해서 알아보았다. 이 글에서는 진리표를 이용한 증명이 언제 어려워지는지(혹은 불가능…</p>"}},{"title":"프로그래머를 위한 논리학 - 0","date":"5 years ago","dateForSort":"2020-03-11T07:30:16.000Z","postPath":"/ko/post/logic-for-programmers-000/","draft":false,"parent":{"excerpt":"<h2 id=\"prologue\" style=\"position:relative;\">들어가며<a href=\"#prologue\" aria-label=\"prologue permalink\" class=\"anchor after\"><svg aria-hidden=\"true\" focusable=\"false\" height=\"16\" version=\"1.1\" viewBox=\"0 0 16 16\" width=\"16\"><path fill-rule=\"evenodd\" d=\"M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z\"></path></svg></a></h2>\n<p>개발자 생활을 하다보면 한 번쯤 듣게 되는 (혹은 보게 되는) 말이 있다. 바로</p>\n<blockquote>\n<p>좋은 개발자가 되려면 수학(혹은 논리학)을 배워야지!</p>\n</blockquote>\n<p>이다. 물론 필자가 이런 주장에 완전히 동의한다는 말은 아니다. 그러나 누군가 위 주장을 아래와 같이 조금 수정한다면, 필자는 언제 어디서든지 옹호할 생각이 있다.</p>"}},{"title":"프로그래머를 위한 논리학 - 2","date":"4 years ago","dateForSort":"2020-06-01T07:30:16.000Z","postPath":"/draft2/ko/post/logic-for-programmers-002/","draft":true,"parent":{"excerpt":"<h2 id=\"prologue\" style=\"position:relative;\">세번째 글을 열면서<a href=\"#prologue\" aria-label=\"prologue permalink\" class=\"anchor after\"><svg aria-hidden=\"true\" focusable=\"false\" height=\"16\" version=\"1.1\" viewBox=\"0 0 16 16\" width=\"16\"><path fill-rule=\"evenodd\" d=\"M4 9h1v1H4c-1.5 0-3-1.69-3-3.5S2.55 3 4 3h4c1.45 0 3 1.69 3 3.5 0 1.41-.91 2.72-2 3.25V8.59c.58-.45 1-1.27 1-2.09C10 5.22 8.98 4 8 4H4c-.98 0-2 1.22-2 2.5S3 9 4 9zm9-3h-1v1h1c1 0 2 1.22 2 2.5S13.98 12 13 12H9c-.98 0-2-1.22-2-2.5 0-.83.42-1.64 1-2.09V6.25c-1.09.53-2 1.84-2 3.25C6 11.31 7.55 13 9 13h4c1.45 0 3-1.69 3-3.5S14.5 6 13 6z\"></path></svg></a></h2>\n<p><a href=\"/ko/post/logic-for-programmers-001/\">지난 글</a>에서는 공리와 추론 규칙에 대해 알아보고, 그 중 '고전 자연 연역 체계'라고 불리는 공리와 추론 규칙의 모음에 대해 설명하고 사용해 보았다. 이번 글은 고전 자연 연역 체계를 …</p>"}}]}]},"site":{"siteMetadata":{"name":"Junyoung/\"Clare\" Jang","shortName":"J. Jang","siteUrl":"https://Ailrun.github.io","description":"Ailrun's Blog","author":"Junyoung/\"Clare\" Jang (@Ailrun)","locales":["ko_KR"],"themeColor":"#000000"}}},"pageContext":{}},"staticQueryHashes":[],"slicesMap":{}} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
<?xml version="1.0" encoding="UTF-8"?><urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:news="http://www.google.com/schemas/sitemap-news/0.9" xmlns:xhtml="http://www.w3.org/1999/xhtml" xmlns:image="http://www.google.com/schemas/sitemap-image/1.1" xmlns:video="http://www.google.com/schemas/sitemap-video/1.1"><url><loc>https://ailrun.github.io/ko/post/logic-for-programmers-000/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/ko/post/logic-for-programmers-001/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/ko/post/trip-to-make-a-blog/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/draft2/ko/post/logic-for-programmers-002/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/en/about/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/en/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/en/projects/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/en/publications/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/ko/about/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/ko/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/ko/posts/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/ko/projects/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/ko/publications/</loc><changefreq>daily</changefreq><priority>0.7</priority></url></urlset> | ||
<?xml version="1.0" encoding="UTF-8"?><urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:news="http://www.google.com/schemas/sitemap-news/0.9" xmlns:xhtml="http://www.w3.org/1999/xhtml" xmlns:image="http://www.google.com/schemas/sitemap-image/1.1" xmlns:video="http://www.google.com/schemas/sitemap-video/1.1"><url><loc>https://ailrun.github.io/ko/post/trip-to-make-a-blog/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/ko/post/logic-for-programmers-001/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/ko/post/logic-for-programmers-000/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/draft2/ko/post/logic-for-programmers-002/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/en/about/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/en/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/en/projects/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/en/publications/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/ko/about/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/ko/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/ko/posts/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/ko/projects/</loc><changefreq>daily</changefreq><priority>0.7</priority></url><url><loc>https://ailrun.github.io/ko/publications/</loc><changefreq>daily</changefreq><priority>0.7</priority></url></urlset> |